Default reasoning using classical logic

Artificial Intelligence

Volumn 84, Issue 1-2, 1996, Pages 113-150

  Ben Eliyahu, Rachel ^a   Dechter, Rina ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; FORMAL LOGIC; LOGIC PROGRAMMING;

CLASSICAL PROPOSITIONAL THEORY; CONSTRAINT SATISFACTION PROBLEM; DEFAULT LOGIC; DEFAULT REASONING; DISJUNCTION FREE DEFAULT THEORY; NETWORK DEFAULT THEORY; PROPOSITIONAL DEFAULT THEORY;

ARTIFICIAL INTELLIGENCE;

EID: 0030193941     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00095-x     Document Type: Article

References (38)

1. R. Ben-Eliyahu, Nonmonotonic reasoning in classical logic, Ph.D. Thesis, University of California, Los Angeles, CA (1993).
2. R. Ben-Eliyahu and R. Dechter, Default logic, propositional logic and constraints, in: Proceedings AAAI-91, Anaheim, CA (1991) 379-385.
3. R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs, Ann. Math. Artif. Intell. 12 (1994) 53-87; short version in: Proceedings 1992 Joint International Conference and Symposium on Logic Programming (1992).
4. R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs, Ann. Math. Artif. Intell. 12 (1994) 53-87; short version in: Proceedings 1992 Joint International Conference and Symposium on Logic Programming (1992).
5. N. Bidoit and C. Froidevaux, Minimalism subsumes default logic and circumscription in stratified logic programming, in: Proceedings IEEE Symposium on Logic in Computer Science, Ithaca, NY (1987) 89-97.
6. C.-L. Chang and R.C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1987).
7. K.L. Clark, Negation as failure, in: H. Gallaire and J. Minker, eds., Logic and Databases (Plenum Press, New York, 1978) 293-322.
8. R. Dechter, Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition, Artif. Intell. 41 (1990) 273-312.
9. R. Dechter and J. Pearl, Network-based heuristics for constraint satisfaction problems, Artif. Intell. 34 (1988) 1-38.
10. R. Dechter and J. Pearl, Tree clustering for constraint networks, Artif. Intell. 38 (1989) 353-366.
11. C. Elkan, A rational reconstruction of nonmonotonic truth maintenance systems, Artif. Intell. 43 (1990) 219-234.
12. D.W. Etherington, Formalizing nonmonotonic reasoning systems, Artif. Intell. 31 (1987) 41-85.
13. D.W. Etherington, Relating default logic and circumscription, in: Proceedings IJCAI-87, Milan, Italy (1987) 489-494.
14. F. Fages, Consistency of Clark's completion and existence of stable models, Meth. Logic Comput. Sci. 2 (1992).
15. K. Fine, The justification of negation as failure, Logic Meth. Philos. Sci. 8 (1989) 263-301.
16. E.C. Freuder, A sufficient condition for backtrack-bounded search, J. ACM 32 (1985) 755-761.
17. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Comput. 9 (1991) 365-385.
18. G. Gottlob, Complexity results for nonmonotonic logics, J. Logic Comput. 2 (1992) 397-425.
19. U. Junker and K. Konolige, Computing the extensions of autoepistemic and default logics with a TMS, in: Proceedings AAAI-90, Boston, MA (1990) 278-283.
20. H.A. Kautz and B. Selman, Hard problems for simple default logics, Artif. Intell. 49 (1991) 243-279.
21. K. Konolige, On the relation between default and autoepistemic logic, Artif. Intell. 35 (1988) 343-382.
22. R.A. Kowalski and C.J. Hogger, Logic programming, in: S.C. Shapiro, ed., Encyclopedia of Artificial Intelligence (Wiley, New York, 2nd ed., 1992) 873-891.
23. C.-T. Lee, A completeness theorem and a Computer Program for finding theorems derivable from given axioms, Ph.D. Thesis, University of California, Berkeley, CA (1967).
24. W. Marek and M. Truszczynski, Relating autoepistemic and default logic, in: R.J. Brachman, H.J. Levesque and R. Reiter, eds., Proceedings First International Conference on Principles of Knowledge Representation and Reasoning, Toronto, Ont. (Morgan Kaufmann, San Mateo, CA (1989) 276-288.
25. W. Marek and M. Truszczyński, Computing intersection of autoepistemic expansions, in: Proceedings First International Workshop on Logic Programming and Non-Monotonic Reasoning, Washington, DC (1991) 37-50.
26. R.E. Mercer, Using default logic to derive natural language presupposition, in: R. Goebel, ed., Proceedings Seventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Edmonton, Alta. (Morgan Kaufmann, Los Altos, CA, 1988) 14-21.
27. E. Minicozzi and R. Reiter, A note on linear resolution strategies in consequence-finding, Artif. Intell. 3 (1972) 175-180.
28. R.C. Moore, Semantical consideration on nonmonotonic logic, Artif. Intell. 25 (1985) 75-94.
29. C.R. Perrault, An application of default logic to speech act theory, Tech. Rept. CSLI-87-90, SRI International, Menlo Park, CA (1987).
30. R. Reiter, A logic for default reasoning, Artif. Intell. 13 (1980) 81-132.
31. R. Reiter, A theory of diagnosis from first principles, Artif. Intell. 32 (1987) 57-95.
32. R. Reiter, Personal communication (1992).
33. R. Reiter and J. de Kleer, Foundations of assumption-based truth maintenance systems: preliminary report, in: Proceedings AAAI-87, Seattle, WA (1987) 183-188.
34. J. Stillman, It's not my default: the complexity of membership problems in restricted propositional default logics, in: Proceedings AAAI-90, Boston, MA (1990) 571-578.
35. J. Stillman, The complexity of propositional default logics, in: Proceedings AAAI-92, San Jose, CA (1992) 794-799.
36. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146-160.
37. R.E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566-579.
38. D.S. Touretzky, Implicit ordering of defaults in inheritance systems, in: Proceedings AAAI-84, Austin, TX (1984) 322-325.