Can Completion Entail Circumscription (Sometimes)?
スポンサーリンク
概要
- 論文の詳細を見る
Circumscription, a form of non-monotonic reasoning, proposed by J.McCarthy, of first-order predicate symbols are second-order formula. The formulas derivable from a theory T augmented by the circumscription of a predicate symbol P are just those true in all models of T minimal in P. In order to achieve this kind of minimal derivation, it is very important to find out some suitable first-order instances of circumscription. As there is actually such instances, we say the theory T is circumscriptively reducible wrt the predicate symbol P. Completion of a theory, proposed by Keith L. Clark, is one way to represent closed world assumption by assuming given sufficient condition about a predicate is also necessary. Shown in ,circumscription of a predicate symbol P in a theory T Horn in P implies the completion of T wrt P. Here we will show that the completion of T wrt P entails the circumscription of P in T in the model-theoretical viewpoint.
- 一般社団法人情報処理学会の論文
- 1988-09-12
著者
-
Togashi Atsushi
Research Institute of Electrical Communication, Tohoku University
-
Togashi A
Tohoku Univ. Sendai Jpn
-
Togashi Atsushi
Research Institute Of Electrical Communication Graduate School Of Information Sciences Tohoku Univer
-
Hou Ben-hui
Research Institute Of Electrical Communication Tohoku University
-
Noguchi S
Research Institute Of Electrical Communication Tohoku University
-
Noguchi Shoichi
Research Center For Applied Information Science Tohoku University
関連論文
- Inductive Inference of Algebraic Processes Based on Hennessy-Milner Logic (Special Section on Net Theory and Its Applications)
- AMLOG : an Amalgamated Equational Logic Programming Language
- Limits on the Performance of Quantum-Controlled Devices
- An Improvement of The Protocol Synthesis Algorithm
- CNV Based Intermedia Synchronization Mechanism under High Speed Communication Environment
- A New Approach for Protocol Synthesis Based on LOTOS (Special Section on Net Theory and Its Applications)
- A Support Method for Specification Process Based on LTSs (Special Section on Net Theory and Its Applications)
- A PROGRAM TRANSFORMATION FROM EQUATIONAL PROGRAMS INTO LOGIC PROGRAMS(Lambda Calculus and Computer Science Theory)
- Generalized Predicate Completion and its Relation to Circumscription
- A Partial Translation of Default Logic to Circumscription
- Can Completion Entail Circumscription (Sometimes)?
- Classification of the NOAA Satellite Image Data by Unsupervised Neural Network
- An Efficient Graph Embedding Algorithm for a Three-Dimensional Cellular Reconfigurable Array
- A Canonical Translation from Higher Order Logic to Typed Lambda Calculus
- Verification and Refinement for System Requirements
- A Real-Time Scheduler Using Neural Networks for Scheduling Independent and Nonpreemptable Tasks with Deadlines and Resource Requirements