Computing with default logic

Artificial Intelligence

Volumn 112, Issue 1, 1999, Pages 105-146

  Cholewiński, Paweł ^a   Marek, Victor W ^b   Mikitiuk, Artur ^c   Truszczyński, Mirosław ^b  

^a Hynomics Corp   (United States)

^b UNIVERSITY OF KENTUCKY   (United States)

^c FORT VALLEY STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SYSTEMS PROGRAMMING; FORMAL LOGIC; LOGIC PROGRAMMING; RESPONSE TIME (COMPUTER SYSTEMS);

DEFAULT LOGIC; DEFAULT REASONING SYSTEMS (DERES);

KNOWLEDGE REPRESENTATION;

EID: 0033170324     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00053-3     Document Type: Article

References (58)

1. K. Apt, H.A. Blair, A. Walker, Towards a theory of declarative knowledge, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 89-142.
2. G. Antoniou, E. Langetepe, V. Sperschneider, New proofs in default logic theory, Ann. Math. Artificial Intelligence 12 (1994) 215-230.
3. R. Ben-Eliyahu, R. Dechter, Default logic, propositional logic and constraints, in: Proc. AAAI-91, Anaheim, CA, Morgan Kaufmann, Los Altos, CA, 1991.
4. R. Ben-Eliyahu, L. Palopoli, Reasoning with minimal models: Efficient algorithms and applications, in: Proc. 4th Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany, Morgan Kaufmann, San Francisco, CA, 1994.
5. P. Besnard, An Introduction to Default Logic, Springer, Berlin, 1989.
6. N. Bidoit, C. Froidevaux, Negation by default and unstratifiable logic programs, Theoret. Comput. Sci. 78 (1991) 85-112.
7. S. Brass, U.W. Lipeck, Bottom-up query evaluation with partially ordered defaults, in: Proc. 3rd Internat. Conference on Deductive and Object-Oriented Databases (DOOD-93), Lecture Notes in Computer Science, Vol. 760, Springer, Berlin, 1993, pp. 253-266.
8. C. Bell, A. Nerode, R. Ng, VS. Subrahmanian, Implementing stable semantics by linear programming, in: A. Nerode, L. Pereira (Eds.), Logic Programming and Non-Monotonic Reasoning, MIT Press, Cambridge, MA, 1993.
9. C. Bell, A. Nerode, R. Ng, V.S. Subrahmanian, Implementing deductive databases by mixed integer programming, ACM Trans. Database Systems 21 (1996) 238-269.
10. B. Bollobás, Random Graphs, Academic Press, New York, 1985.
11. G. Brewka, Nonmonotonic Reasoning: Logical Foundations of Commonsense, Cambridge University Press, Cambridge, UK, 1991.
12. J.M. Crawford, L.D. Auton, Experimental results on the crossover point in random 3-SAT, Artificial Intelligence 81 (1996) 31-57.
13. J.M. Crawford, A.B. Baker, Experimental results on the application of satisfiability algorithms to scheduling problems, in: Proc. AAAI-94, Seattle, WA, 1994.
14. M. Cadoli, P.M. Donini, M. Schaerf, Is intractability of nonmonotonic reasoning a real drawback?, in: Proc. AAAI-94, Seattle, WA, 1994, pp. 946-951.
15. P. Cholewiński, Reasoning with stratified default theories, in: Proc. LPNMR-95, Lecture Notes in Computer Science, Vol. 928, Springer, Berlin, 1995, pp. 273-286.
16. P. Cholewiński, Stratified default theories, in: Proc. CSL-94, Lecture Notes in Computer Science, Vol. 933, Springer, Berlin, 1995, pp. 456-470.
17. P. Cholewiński, W. Marek, A. Mikitiuk, M. Truszczyński, Experimenting with nonmonotonic reasoning, in: Proc. 12th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 267-281.
18. P. Cholewiński, W. Marek, M. Truszczyński, Default reasoning system deres, in: Proc. 5th Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-96), Cambridge, MA, 1996, pp. 518-528.
19. O. Dubois, P. Andre, Y. Boufkhad, J. Carlier, Sat versus unsat, in: Cliques, coloring and satisfiability, second DIMACS implementation challenge, American Mathematical Society, Providence, RI, 1996, pp. 415-436.
20. J. Dix, U. Furbach, A. Nerode (Eds.), Proc. 4th Internat. Conference on Logic Programming and Non-Monotonic Reasoning, Springer, Berlin, 1997.
21. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello, The KR system dlv: Progress report, comparisons, and Benchmarks, in: A.G. Cohn, L. Schubert, S.C. Shapiro (Eds.), Proc. 6th Internat. Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy, 1998, pp. 406-417.
22. D.W. Etherington, R. Reiter, On inheritance hierarchies with exceptions, in: Proc. AAAI-83, Washington, DC, 1983, pp. 104-108.
23. D.W. Etherington, Reasoning with Incomplete Information, Pitman, London, 1988.
24. M.L. Ginsberg, Counterfactuals, Artificial Intelligence 30 (1986) 35-79
25. G. Gogic, H. Kautz, Ch. Papadimitriou, B. Selman, Compactness of knowledge representation: A comparative analysis, in: Proc. IJCAI-95, Montreal, Quebec, 1995, pp. 862-869.
26. M. Gelfond, V. Lifschitz, The stable semantics for logic programs, in: R. Kowalski, K. Bowen (Eds.), Proc. 5th International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
27. M. Gelfond, V Lifschitz, Representing actions in extended logic programming, in: Proc. Internat. Joint Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1992, pp. 559-573.
28. M.L. Ginsberg, D.A. McAllester, Gsat and dynamic backtracking, in: J. Doyle, E. Sandewall, P. Torasso (Eds.), Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany, Morgan Kaufmann, San Francisco, CA, 1994, pp. 226-237.
29. G. Gottlob, Complexity results for nonmonotonic logics, J. Logic Comput. 2 (1992) 397-425.
30. S. Hanks, D. McDermott, Default reasoning, nonmonotonic logics and frame problem, in: Proc. AAAI-86, Philadelphia, PA, 1986, pp. 328-333
31. R.W. Hockney, The Science of Computer Benchmarking, SIAM, Philadelphia, PA, 1996.
32. U. Junker, K. Konolige, Computing the extensions of autoepistemic and default logics with a truth maintenance system, in: Proc. AAAI-90, Boston, MA, 1990.
33. D.E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, Reading, MA, 1993.
34. H.A. Kautz, B. Selman, Hard problems for simple default logics, in: Proc. 1st Internat. Conference on Principles of Knowledge Representation and Reasoning (Kr-89), Toronto, Ontario, Morgan Kaufmann, San Francisco, CA, 1989, pp. 189-197.
35. V. Lifschitz, H. Turner, Splitting a logic program, in: P. Van Hentenryck (Ed.), Proc. 11th Internat. Conference on Logic Programming, 1994, pp. 23-37.
36. J. McCarthy, Circumscription - A form of nonmonotonic reasoning, Artificial Intelligence 13 (1980) 27-39.
37. D. McDermott, J. Doyle, Nonmonotonic logic I, Artificial Intelligence 13 (1980) 41-72.
38. W. Marek, M. Truszczyński, Stable semantics for logic programs and default theories, in: E. Lusk, R. Overbeek (Eds.), Proc. North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 243-256.
39. W. Marek, M. Truszczyński, Autoepistemic logic, J. ACM 38 (1991) 588-619.
40. W. Marek, M. Truszczyński, Nonmonotonic logics; Context-Dependent Reasoning, Springer, Berlin, 1993.
41. W. Marek, M. Truszczyński, Stable models and an alternative logic programming paradigm, in: K.R. Apt, W. Marek, M. Truszczyński, D.S. Warren (Eds.), The Logic Programming Paradigm: A 25-year Perspective, Springer, Berlin, 1999, pp. 375-398.
42. D. Maier, D.S. Warren, Computing with logic. Logic Programming with Prolog, Benjamin/Cummings, Menlo Park, CA, 1988.
43. I. Niemelä, On the decidability and complexity of autoepistemic reasoning, Fundamenta Informaticae 17 (1992) 117-155.
44. I. Niemelä, Logic programs with stable model semantics as a constraint programming paradigm, in: I. Niemelä, T. Schaub (Eds.), Proc. Workshop on Computational Aspects of Nonmonotonic Reasoning, 1998, pp. 72-79.
45. I. Niemelä, P. Simons, Evaluating an algorithm for default reasoning, in: Proc. IJCAI-95, Montreal, Quebec, 1995.
46. I. Niemelä, P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proc. JICSLP-96, MIT Press, Cambridge, MA, 1996.
47. D. Poole, Normality and faults in logic-based diagnosis, in: Proc. IJCAI-89, Detroit, MI, Morgan Kaufmann, San Mateo, CA, 1989, pp. 1206-121
48. 2. R. Reiter, G. Criscuolo, On interacting defaults, in: Proc. IJCAI-81, Vancouver, BC, 1981, pp. 270-276.
49. R. Reiter, On closed world data bases, in: H. Gallaire, J. Minker (Eds.), Logic and Data Bases, Plenum Press, New York, 1978, pp. 55-7
50. 6. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81-132.
51. R. Reiter, A theory of diagnosis from first principles, Artificial Intelligence 32 (1987) 57-95.
52. P. Rao, I.V. Ramskrishnan, K. Sagonas, T. Swift, D.S. Warren, J. Freire, XSB: A system for efficiently computing well-founded semantics, in: Proc. LPNMR-97, Lecture Notes in Computer Science, Vol. 1265, Springer, Berlin, 1997, pp. 430-440.
53. B. Selman, H.A. Kautz, B. Cohen, Local search strategies for satisfiability testing, in: Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, American Mathematical Society, Providence, RI, 1996, pp. 521-531.
54. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, In: Proc. AAAI-92, San Jose, CA, Morgan Kaufmann, Los Altos, CA, 1992, pp. 440-446.
55. V.S. Subrahmanian, D. Nau, C. Vago, Wfs + branch bound = stable models, IEEE Trans. Knowledge and Data Engineering 7 (1995) 362-377.
56. L. Sterling, E. Shapiro, The Art of Prolog, MIT Press, Cambridge, MA, 1986.
57. J. Stillman, The complexity of propositional default logics, in: Proc. AAAI-92, San Jose, CA, Morgan Kaufmann, Menlo Park, CA, 1992, pp. 794-799.
58. C. Zaniolo, Design and implementation of logic based language for data intensive applications, in: Proc. International Conference on Logic Programming, MIT Press, Cambridge, MA, 1988.