Embedding circumscriptive theories in general disjunctive programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 928, Issue , 1995, Pages 344-357

  Sakama, Chiaki ^a,c   Inoue, Katsumi ^b  

^a ASTEM Res Inst of Kyoto   (Japan)

^b TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^c WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; EMBEDDINGS; LOGIC PROGRAMMING;

ABDUCTIVE LOGIC PROGRAMMING; COMMONSENSE KNOWLEDGE; NEGATION AS FAILURES; NEW APPLICATIONS;

PROGRAM TRANSLATORS;

EID: 84947935402     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59487-6_25     Document Type: Conference Paper

References (32)

1. [BS85] Bossu, G. and Siegel, P., Satutation, Nonmonotonic Reasoning and the Closed World Assumption, Artificial Intelligence 25, 13-63, 1985.
2. [CEG92] Cadoli, M., Eiter, T. and Gottlob, G., An Efficient Method for Eliminating Varying Predicates from a Circumscription, Artificial Intelligence 54, 397-410, 1992.
3. [dKK89] de Kleer, J. and Konolige, K., Eliminating the Fixed Predicates from a Circumscription, Artificial Intelligence 39, 391-398, 1989.
4. [GL88a] Gelfond, M. and Lifschitz, V., Compiling Circumscriptive Theories into Logic Programs, Proc. AAAI-88, 455-459. Extended version in: Proc. 2nd Int. Workshop on Nonmonotonic Reasoning, LNAI 346, 74-99, 1988.
5. [GL88b] Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, Proc. ICLP'88, 1070-1080.
6. [GPP89] Gelfond, M., Przymusinska, H. and Przymusinski, T., On the Relation between Circumscription and Negation as Failure, Artificial Intelligence 38, 75-94, 1989.
7. [GL91] Gelfond, M. and Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing 9, 365-385, 1991.
8. [GLPS94] Gelfond, M., Lifschitz, V., Przymusinska, H. and Schwarz, G., Autoepistemic Logic and Introspective Circumscription, Proc. TARK'94, 197-207.
9. [Gin89] Ginsberg, M. L., A Circumscriptive Theorem Prover, Artificial Intelligence 39, 209-230, 1989.
10. [HIP91] Helft, N., Inoue, K. and Poole, D., Query Answering in Circumscription, Proc. IJCAI-91, 426-431.
11. [Ino92] Inoue, K., Linear Resolution for Consequence Finding, Artificial Intelligence 56, 301-353, 1992.
12. [IS94] Inoue, K. and Sakama, C., On Positive Occurrences of Negation as Failure, Proc. KR'94, 293-304.
13. [KKT92] Kakas, A. C., Kowalski, R. A. and Toni, F., Abductive Logic Programming, J. Logic and Computation 2, 719-770, 1992.
14. [Kon89] Konolige, K., On the Relation between Autoepistemic Logic and Circumscription, Proc. IJCAI-89, 1213-1218.
15. [Lif85a] Lifschitz, V., Closed World Databases and Circumscription, Artificial Intelligence 27, 229-235, 1985.
16. [Lif85b] Lifschitz, V., Computing Circumscription, Proc. IJCAI-85, 121-127.
17. [Lif88] Lifschitz, V., On the Declarative Semantics of Logic Programs with Negation, in Foundations of Deductive Databases and Logic Programming(J. Minker ed.), Morgan Kaufmann, 177-192, 1988.
18. [Lif89] Lifschitz, V., Between Circumscription and Autoepistemic Logic, Proc. KR'89, 235-244.
19. [LW92] Lifschitz, V. and Woo, T. Y. C., Answer Sets in General Nonmonotonic Reasoning (preliminary report), Proc. KR'92, 603-614.
20. [Lif93] Lifschitz, V., Restricted Monotonicity, Proc. AAAI-93, 432-437.
21. [Lif94a] Lifschitz, V., Minimal Belief and Negation as Failure, Artificial Intelligence 70, 53-72, 1994.
22. [Lif94b] Lifschitz, V., Circumscription, in Handbook of Logic in Artificial Intelligence and Logic Programming (D. M. Gabbay, et al. eds.), Clarendon Press, 297-352, 1994.
23. [LT94] Lifschitz, V. and Turner, H., From Disjunctive Programs to Abduction, Proc. ICLP'94 Workshop on Nonmonotonic Extensions of Logic Programming, 111-125.
24. [LS92] Lin F. and Shoham, Y., A Logic of Knowledge and Justified Assumptions, Artificial Intelligence 57, 271-289, 1992.
25. [Lov78] Loveland, D. W., Automated Theorem Proving: A Logical Basis, North-Holland, 1978.
26. [Mc80] McCarthy, J., Circumscription — A Form of Nonmonotonic Reasoning, Artificial Intelligence 13, 27-39, 1980.
27. [Prz88] Przymusinski, T. C., On the Declarative Semantics of Deductive Databases and Logic Programs, in the same source book as [Lif88], 193-216, 1988.
28. [Prz89] Przymusinski, T., An Algorithm to Compute Circumscription, Artificial Intelligence 38, 49-73, 1989.
29. [Prz91] Przymusinski, T. C., Stable Semantics for Disjunctive Programs, New Generation Computing 9, 401-424, 1991.
30. [Rei82] Reiter, R., Circumscription implies Predicate Completion (sometimes), Proc. AAAI-82, 418-420.
31. [SI93] Sakama, C. and Inoue, K., Relating Disjunctive Logic Programs to Default Theories, Proc. LPNMR'93, 266-282.
32. [YY93] Yuan, L. Y. and You, J-H., Autoepistemic Circumscription and Logic Programming, J. Automated Reasoning 10, 143-160, 1993.