Compiling Circumscriptive Theories into Logic Programs: Preliminary Report

Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988

Volumn , Issue , 1988, Pages 455-459

  Gelfond, Michael ^a   Lifschitz, Vladimir ^b  

^a UNIVERSITY OF TEXAS AT EL PASO   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

FORMALISATION; INHERITANCE SYSTEMS; LITERALS; LOGIC PROGRAMS; LOGIC-PROGRAMMING; TREE-STRUCTURED;

LOGIC PROGRAMMING;

EID: 85156201003     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Krzysztof R. Apt, Howard A. Blair, and Adrian Walker. Towards a theory of declarative knowledge. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann Publishers, Los Altos, CA, 1988.
2. Genevieve Bossu and Pierre Siegel. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence, 25(l):13-63, 1985.
3. Maarten H. van Emden and Robert A. Kowalski. The semantics of predicate logic as a programming language, Journal ACM, 23(4):733-742, 1976.
4. Michael Gelfond. On stratified autoepistemic theories. In Proceedings AAAI-87, 1, pages 207-211. Morgan Kaufmann Publishers, Los Altos, CA, 1987.
5. Michael Gelfond and Halina Przymusinska. Negation as failure: Careful closure procedure. Artificial Intelligence 30(3):273-288, 1986.
6. Matthew Ginsberg. A circumscriptive theorem prover: preliminary report. In these Proceedings.
7. Vladimir Lifschitz. Computing circumscription. In Proceedings IJCAI-85, 1, pages 121-127. Morgan Kaufmann Publishers, Los Altos, CA, 1985.
8. Vladimir Lifschitz. On the declarative semantics of logic programs with negation. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, pages 177-192. Morgan Kaufmann Publishers, Los Altos, CA, 1988.
9. John McCarthy. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence 13(l,2):27-39, 1980.
10. John McCarthy. Applications of circumscription to formalizing commonsense knowledge, Artificial Intelligence 28(1):89-118, 1986.
11. Bernard Meltzer. Theorem proving for computers: some results on resolution and renaming. Comput. Journal, 8:341-343, 1966.
12. Teodor Przymusinski, Query answering in circumscriptive and closed-world theories. In Proceedings AAAI-86, 1, pages 186-190. Morgan Kaufmann Publishers, Los Altos, CA, 1986.
13. Teodor Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, pages 193-216. Morgan Kaufmann Publishers, Los Altos, CA, 1988.
14. Teodor Przymusinski. On the declarative and procedural semantics of logic programs. Preprint, University of Texas at El Paso, 1988.
15. Allen Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, pages 149-176. Morgan Kaufmann Publishers, Los Altos, CA, 1988.