References

1. A. Analyti and S. Pramanik , Reliable semantics for extended logic programs with rule prioritization. J. Logic Comput. 5 3 (1995), pp. 303–324.

2. K.R. Apt, H.A. Blair and A. Walker , Towards a theory of declarative knowledge. In: J. Minker, Editor, Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA (1988), pp. 89–148.

3. F. Baader and B. Hollunder , Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. J. Automat. Reason. 15 (1995), pp. 41–68. View Record in Scopus | Cited By in Scopus (17)

4. C. Baral and M. Gelfond , Logic programming and knowledge representation. J. Logic Programming 19–20 (1994), pp. 73–148. Abstract | PDF (5615 K) | View Record in Scopus | Cited By in Scopus (104)

5. G. Bossu and P. Siegel , Saturation, nonmonotonic reasoning and the closed world assumption. Artificial Intelligence 25 (1995), pp. 13–63.

6. G. Brewka , Reasoning about priorities in default logic. In: AAAI-94, Seattle, WA, MIT Press, Cambridge, MA (1994), pp. 940–945. View Record in Scopus | Cited By in Scopus (19)

7. G. Brewka , Well-founded semantics for extended logic programs with dynamic preferences. J. Artificial Intelligence Res. 4 (1996), pp. 19–36. View Record in Scopus | Cited By in Scopus (42)

8. G. Brewka and T. Eiter , Preferred answer sets for extended logic programs. Artificial Intelligence 109 (1999), pp. 297–356. Abstract | PDF (442 K) | View Record in Scopus | Cited By in Scopus (71)

9. F. Buccafurri, N. Leone and P. Rullo , Semantics and expressiveness of disjunctive ordered logic. Ann. Math. Artificial Intelligence 25 (1999), pp. 311–337. View Record in Scopus | Cited By in Scopus (6)

10. F. Buccafurri, W. Faber and N. Leone , Disjunctive logic programs with inheritance. In: Proc. 1999 International Conference on Logic Programming, MIT Press, Cambridge, MA (1999), pp. 79–93.

11. J. Chen , Embedding prioritized circumscription in logic programs. In: Proc. 10th International Symposium on Foundations of Intelligent Systems (ISMIS-97)Lecture Notes in Artificial Intelligence 1325, Springer, Berlin (1997), pp. 50–59.

12. J. Delgrande and T. Schaub , Compiling reasoning with and about preference into default logic. In: Proc. IJCAI-97, Nagoya, Japan, Morgan Kaufmann, Los Altos, CA (1997), pp. 168–174.

13. Y. Dimopoulos and A.C. Kakas , Logic programming without negation as failure. In: Proc. 1995 International Logic Programming Symposium, MIT Press, Cambridge, MA (1995), pp. 369–383.

14. T. Eiter and G. Gottlob , The complexity of logic-based abduction. J. ACM 42 (1995), pp. 3–42. View Record in Scopus | Cited By in Scopus (77)

15. T. Eiter, G. Gottlob and N. Leone , Abduction from logic programs: Semantics and complexity. Theoret. Comput. Sci. 189 1–2 (1997), pp. 129–177. Abstract | PDF (3709 K) | View Record in Scopus | Cited By in Scopus (33)

16. T. Eiter, W. Faber, N. Leone and G. Pfeifer , The diagnosis front-end of the dlv system. AI Comm. 12 (1999), pp. 99–111. View Record in Scopus | Cited By in Scopus (23)

17. D.W. Etherington , Formalizing nonmonotonic reasoning systems. Artificial Intelligence 31 (1987), pp. 41–85. Abstract | PDF (2031 K) | View Record in Scopus | Cited By in Scopus (27)

18. M. Gelfond and V. Lifschitz , Compiling circumscriptive theories into logic programs. In: Proc. AAAI-88, St. Paul, MN, MIT Press, Cambridge, MA (1988), pp. 455–459.

19. M. Gelfond Epistemic approach to formalization of commonsense reasoning, Technical Report TR-91-2, University of Texas at El Paso, TX (1991).

20. M. Gelfond and V. Lifschitz , Classical negation in logic programs and disjunctive databases. New Generation Comput. 9 3,4 (1991), pp. 365–385.

21. M. Gelfond and T.C. Son , Reasoning with prioritized defaults. In: Proc. 3rd International Workshop on Logic Programming and Knowledge RepresentationLecture Notes in Artificial Intelligence 1471, Springer, Berlin (1998), pp. 164–223.

22. G. Gottlob , Complexity results for nonmonotonic logics. J. Logic Comput. 2 3 (1992), pp. 397–425.

23. B.N. Grosof , Generalizing prioritization. In: Proc. 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA, Morgan Kaufmann, Los Altos, CA (1991), pp. 289–300.

24. B.N. Grosof , Prioritized conflict handling for logic programs. In: Proc. 1997 International Logic Programming Symposium, MIT Press, Cambridge, MA (1997), pp. 197–211.

25. K. Govindarajan, B. Jayaraman and S. Mantha , Preference logic programming. In: Proc. 12th International Conference on Logic Programming, MIT Press, Cambridge, MA (1995), pp. 731–745.

26. K. Inoue and C. Sakama , Negation as failure in the head. J. Logic Program. 35 1 (1998), pp. 39–78 A shorter version: On positive occurrences of negation as failure, in: Proc. 4th International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany, Morgan Kaufmann, Los Altos, CA, 1994, pp. 293–304 . Abstract | PDF (2281 K) | View Record in Scopus | Cited By in Scopus (31)

27. K. Inoue , Linear resolution for consequence finding. Artificial Intelligence 56 (1992), pp. 301–353. Abstract | PDF (2608 K) | View Record in Scopus | Cited By in Scopus (45)

28. K. Inoue , Hypothetical reasoning in logic programs. J. Logic Programming 18 3 (1994), pp. 191–227. Abstract | PDF (2746 K) | View Record in Scopus | Cited By in Scopus (10)

29. K. Inoue and C. Sakama , A fixpoint characterization of abductive logic programs. J. Logic Programming 27 2 (1996), pp. 107–136 A shorter version: Transforming abductive logic programs to disjunctive programs, in: Proc. 10th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 335–353 . Abstract | PDF (1725 K) | View Record in Scopus | Cited By in Scopus (16)

30. K. Inoue and C. Sakama , Abducing priorities to derive intended conclusions. In: Proc. IJCAI-99, Stockholm, Sweden, Morgan Kaufmann, Los Altos, CA (1999), pp. 44–49.

31. T. Janhunen , On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription. In: Proc. European Workshop on Logics in Artificial Intelligence (JELIA-98)Lecture Notes in Artificial Intelligence 1489, Springer, Berlin (1998), pp. 216–232.

32. A.C. Kakas, R.A. Kowalski and F. Toni , Abductive logic programming. J. Logic Comput. 2 (1992), pp. 719–770.

33. R.A. Kowalski , Algorithm = Logic + Control. Comm. ACM 22 (1979), pp. 424–435.

34. R.A. Kowalski and F. Sadri , Logic programs with exception. New Generation Comput. 9 3, 4 (1991), pp. 387–400.

35. V. Lifschitz , Computing circumscription. In: Proc. IJCAI-85, Los Angeles, CA, Morgan Kaufmann, Los Altos, CA (1985), pp. 121–127.

36. V. Lifschitz , On the satisfiability of circumscription. Artificial Intelligence 28 (1986), pp. 17–27. Abstract | PDF (476 K) | View Record in Scopus | Cited By in Scopus (7)

37. V. Lifschitz and T.Y.C. Woo , Answer sets in general nonmonotonic reasoning (preliminary report). In: Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA, Morgan Kaufmann, Los Altos, CA (1992), pp. 603–614.

38. V. Lifschitz , Minimal belief and negation as failure. Artificial Intelligence 70 (1994), pp. 53–72. Abstract | PDF (1032 K) | View Record in Scopus | Cited By in Scopus (26)

39. V. Lifschitz , Circumscription. In: D.M. Gabbay et al.Handbook of Logic in Artificial Intelligence and Logic Programming 3, Clarendon Press, Oxford (1994), pp. 297–352.

40. J.W. Lloyd Foundations of Logic Programming (2nd edn. ed.),, Springer, Berlin (1987).

41. J. Lobo, J. Minker and A. Rajasekar Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA (1992).

42. J. McCarthy , Circumscription—A form of nonmonotonic reasoning. Artificial Intelligence 13 (1980), pp. 27–39. Abstract | PDF (1148 K) | View Record in Scopus | Cited By in Scopus (291)

43. L.M. Pereira, J.J. Alferes and N. Aparicio , Contradiction removal within well-founded semantics. In: Proc. 1st International Workshop on Logic Programming and Nonmonotonic Reasoning, MIT Press, Cambridge, MA (1991), pp. 105–119.

44. D. Poole , A logical framework for default reasoning. Artificial Intelligence 36 1 (1988), pp. 27–47. Abstract | PDF (942 K) | View Record in Scopus | Cited By in Scopus (135)

45. S. Pradhan and J. Minker , Using priorities to combine knowledge bases. J. Intelligent and Cooperative Information Systems 5 2, 3 (1996), pp. 333–364. View Record in Scopus | Cited By in Scopus (7)

46. T.C. Przymusinski , On the declarative semantics of deductive databases and logic programs. In: J. Minker, Editor, Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA (1988), pp. 193–216.

47. T.C. Przymusinski , Stable semantics for disjunctive programs. New Generation Comput. 9 3, 4 (1991), pp. 401–424.

48. R. Reiter , A logic for default reasoning. Artificial Intelligence 13 (1980), pp. 81–132. Abstract | PDF (4152 K) | View Record in Scopus | Cited By in Scopus (621)

49. R. Reiter and G. Criscuolo , On interacting defaults. In: Proc. IJCAI-81, Vancouver, BC, Morgan Kaufmann, Los Altos, CA (1981), pp. 270–276. View Record in Scopus | Cited By in Scopus (27)

50. J. Rintanen , Lexicographic priorities in default logic. Artificial Intelligence 106 (1998), pp. 221–265. Article | PDF (3558 K) | View Record in Scopus | Cited By in Scopus (12)

51. Y. Shoham , Nonmonotonic logics: Meaning and utility. In: Proc. IJCAI-87, Milan, Italy, Morgan Kaufmann, Los Altos, CA (1987), pp. 388–393.

52. C. Sakama and K. Inoue , Embedding circumscriptive theories in general disjunctive programs. In: Proc. 3rd International Conference on Logic Programming and Nonmonotonic ReasoningLecture Notes in Artificial Intelligence 928, Springer, Berlin (1995), pp. 344–357.

53. C. Sakama and K. Inoue , Representing priorities in logic programs. In: Proc. 1996 Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA (1996), pp. 82–96.

54. M.E. Stickel , Rationale and methods for abductive reasoning in natural-language interpretation. In: Proc. International Scientific Symposium on Natural Language and LogicLecture Notes in Artificial Intelligence 459, Springer, Berlin (1989), pp. 233–252.

55. T. Wakaki and K. Satoh , Compiling prioritized circumscription into extended logic programs. In: Proc. IJCAI-97, Nagoya, Japan, Morgan Kaufmann, Los Altos, CA (1997), pp. 182–187.

56. X. Wang, J.-H. You and L.-Y. Yuan , Nonmonotonic reasoning by monotonic inferences with priority constraints. In: Proc. 2nd International Workshop on Nonmonotonic Extensions of Logic ProgrammingLecture Notes in Artificial Intelligence 1216, Springer, Berlin (1996), pp. 91–109.

57. Y. Zang and N. Foo , Answer sets for prioritized logic programs. In: Proc. 1997 International Logic Symposium, MIT Press, Cambridge, MA (1997), pp. 69–83.

58. Y. Zang and N. Foo , Updating logic programs. In: Proc. 13th European Conference on Artificial Intelligence, Wiley, Chichester, UK (1998), pp. 403–407.