✦ LIBER ✦

Computing protected circumscription

✍ Scribed by Jack Minker; Donald Perlis

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 863 KB
Volume: 2
Category: Article
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(85)80002-9

No coin nor oath required. For personal study only.

✦ Synopsis

This paper deals with computing circumscription in the case of Horn data with additional protection (indefinite data), an intermediate investigation between Reiter's result on predicate completion and Lifschitz's efforts to make general (formula) circumscription more efficient as a computational tool. Reiter has shown a close tie between McCarthy's circumscription and Clark's predicate completion. Here we investigate a similar tie between an extended version of circumscription involving protected data, and an extended version of predicate completion. When we have a fully ground atomic protected theory, we show that an extension to the relational algebra Can be used to obtain all (and only) correct answers. When general Horn axioms are added to the protected theory, we show that Horn axioms also can be used to compute sound answers; however, some correct answers will not be found.

📜 SIMILAR VOLUMES

Circumscripte Skelerodermie

✍ Chr. Eberhartinger 📂 Article 📅 1957 🏛 Springer-Verlag 🌐 English ⚖ 76 KB

Circumscription: Completeness reviewed

✍ Manfred Jaeger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 433 KB

In this paper we demonstrate that some results on the completeness of P-defining theories published earlier are incorrect. We point out that by restricting the original propositions to well-founded theories results somewhat weaker than the original ones can be retained. We also present a theorem tha

History of circumscription

✍ John McCarthy 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Abstract minimality and circumscription

✍ Churn Jung Liau; Bertrand I-peng Lin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 768 KB

In this paper, we present an alternative approach to the generalization of circumscription. Traditionally, the generalization of circumscription involves the change of ordering among models, while in the present study we only try to generalize the minimality criteria of models. We define the notion

Completeness results for circumscription

✍ Donald Perlis; Jack Minker 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Loop formulas for circumscription

✍ Joohyung Lee; Fangzhen Lin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 174 KB