Embedding prioritized circumscription in logic programs

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

Volumn 1325, Issue , 1997, Pages 50-59

  Chen, Jianhua ^a  

^a Louisiana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; INTELLIGENT SYSTEMS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

DISJUNCTIVE LOGIC PROGRAMS; EXPRESSIVE POWER; LOGIC PROGRAMS; NEGATION AS FAILURES; PARALLEL CIRCUMSCRIPTION; PRIORITIZED CIRCUMSCRIPTION; STABLE MODEL;

COMPUTER CIRCUITS;

EID: 84947770641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63614-5_5     Document Type: Conference Paper

References (21)

1. J. Chen, Minimal Knowledge + Negation as Failure = Only Knowing (sometimes). Proceedings of the 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, June 1993, pp. 132-150.
2. C. Sakama, K. Inoue, Embedding Circumscriptive Theories in General Disjunctive Programs, Proceedings of the 3rd International Workshop on Logic Programming and Non-monotonic Reasoning, June 1995, pp. 344-357.
3. C. Sakama, K. Inoue, Representing Priorities in Logic Programs, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, pp. 82-96.
4. M. Gelfond and V. Lifschitz, Compiling Circumscriptive Theories in Logic Programs, Proceedings of 2nd International Workshop on Nonmonotonic Reasoning, 1988, LNAI 346, pp. 74-99.
5. M. Gelfond and V. Lifschitz, Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9 (1991), pp. 365-385.
6. M. Gelfond, H. Przymusinska, and T. Przymusinski, On the Relationship between Circumscription and Negation as Failure, Artificial Intelligence, 38 (1989), pp. 75-94.
7. K. Inoue, C. Sakama, On Positive Occurrences of Negation as Failure, Proceedings of KR'94, pp. 293-304.
8. S. Kundu and J. Chen, A New Class of Theories for Which Circumscription Can Be Obtained via The Predicate Completion. Journal of Experimental and Theoretical AI, 8 (1996), pp. 191-205.
9. V. Lifschitz, Closed World Databases and Circumscription, Artificial Intelligence, 27 (1985), pp. 229-235.
10. V. Lifschitz, Computing Circumscription, Proceedings of IJCAI-85, pp. 121-127.
11. V. Lifschitz, On the Declarative Semantics of Logic Programs with Negation, In Foundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, 1988, pp. 177-192.
12. V. Lifschitz, Minimal Belief and Negation As Failure. Artificial Intelligence, 70 (1-2), 1994, pp. 53-72.
13. V. Lifschitz, G. Schwarz, Extended Logic Programs as Autoepistemic Theories, Proceedings of the 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, June 1993, pp. 101-114.
14. V. Lifschitz, T. Woo, Answer Sets in General Nonmonotonic Reasoning (preliminary report), Proceedings of KR'92, pp. 603-614.
15. W. Marek and M. Truszczynski, Reflexive Autoepistemic Logic and Logic Programming, Proceedings of the 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, June 1993, pp. 115-131.
16. J. McCarthy, Circumscription-A Form of Non-monotonic Reasoning, Artificial Intelligence 13 (1-2), 1980, pp. 27-39.
17. R. Moore, Semantical Considerations on Nonmonotonic Logic, Artificial Intelligence, 25 (1), 1985, pp. 75-94.
18. T. Przymusinski, On the Declarative Semantics of Deductive Databases and Logic Programs, In Foundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, 1988, pp. 193-216.
19. T. Przymusinski, An Algorithm to Compute Circumscription, Artificial Intelligence, 38 (1989), pp. 49-73.
20. R. Reiter, A Logic for Default Reasoning, Artificial Intelligence, 13 (1-2), 1980, pp. 81-132.
21. R. Reiter, Circumscription Implies Predicate Completion (sometimes), Proceedings of AAAI'82, pp. 418-420.