A unifying view for logic programming with non-monotonic reasoning

Theoretical Computer Science

Volumn 184, Issue 1-2, 1997, Pages 1-59

  Brogi, Antonio ^a   Lamma, Evelina ^b   Mancarella, Paolo ^a   Mello, Paola ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c UNIVERSITY OF FERRARA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; MATHEMATICAL MODELS; THEOREM PROVING;

NON CONTRADICTORY ABDUCTIVE LOGIC PROGRAM; NON MONOTONIC REASONING;

LOGIC PROGRAMMING;

EID: 0031223533     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)80755-4     Document Type: Review

References (73)

1. J.J. Alferes, personal communication, 1993.
2. J.J. Alferes, C.V. Damasio and L.M. Pereira, Top-down query evaluation for well-founded semantics with explicit negation, In: A. Cohn, ed., Proc. ECAI94 (Morgan Kaufmann, Los Altos, CA, 1994) 140-144.
3. J.J. Alferes, C.V. Damasio and L.M. Pereira, SLX - A top-down derivation procedure for programs with explicit negation, in: M. Bruynooghe, ed., Proc. Internat. Symp. on Logic Programming ILPS94 (MIT Press, Cambridge, MA, 1994).
4. J.J. Alferes, C.V. Damasio and L.M. Pereira, A logic programming system for non-monotonic reasoning, J. Automat. Reasoning 14 (1995) 93-147.
5. J.J. Alferes, P.M. Dung and L.M. Pereira, Scenario semantics of extended logic programs. in: L.M. Pereira and A. Nerode, eds., Proc. 2nd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, MA, 1993) 334-348.
6. J.J. Alferes and L.M. Pereira, On logic program semantics with two kinds of negation, in: K. Apt, ed., Proc. Internat. Joint Conf. and Symp. on Logic Programming (MIT Press, Cambridge, MA, 1992) 574-588.
7. J.J. Alferes and L.M. Pereira, Optative reasoning with scenario semantics, in: D.S. Warren, ed., Proc. 10th Internat. Conf. on Logic Programming (MIT Press, Cambridge, MA, 1993) 601-615.
8. J.J. Alferes and L.M. Pereira, Contradiction: when avoidance equals removal - Part I, in: R. Dychoff, ed., Proc. 4th Internat. Workshop on Extensions of Logic Programming, Lecture Notes in Computer Science, Vol. 798 (Springer, Berlin, 1994) 11-23.
9. J.J. Alferes and L.M. Pereira, Contradiction: when avoidance equals removal - Part II, in: R. Dychoff, ed., Proc. 4th Internat. Workshop on Extensions of Logic Programming, Lecture Notes in Computer Science, Vol. 798 (Springer, Berlin, 1994) 268-281.
10. J.J. Alferes, T.C. Przymusinski and L.M. Pereira, "Classical" negation in non-monotonic reasoning and logic programming, in: Proc. Int. Workshop on Artificial Intelligence and Mathematics. Fort Laudersdale, Florida, January 1996.
11. C. Aravindan and P.M. Dung, On the Correctness of unfold/fold transformation of normal and extended logic programs, J. Logic Programming 24 (1995) 201-217.
12. K.R. Apt, Logic programming, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 493-574.
13. K.R. Apt and M. Bezem, Acyclic programs, New Generation Computing 9 (Springer, Berlin, 1991) 335-363.
14. K.R. Apt and R.N. Bol, Logic programming and negation: a survey. J. Logic Programming 19/20 (1994) 9-71.
15. C. Baral and M. Gelfond, Logic programming and knowledge representation, J. Logic Programming 19/20 (1994) 73-148.
16. A. Bondarenko, F. Toni and R.A. Kowalski, An Assumption-based framework for non-monotonic reasoning, in: L.M. Pereira and A. Nerode, eds., Proc. 2nd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, 1993) 171-189.
17. A. Bossi, M. Gabbrielli, G. Levi and M.C. Meo, Contributions to the semantics of open logic programs, in: Proc. Internat. Conf. on Fifth Generation Computer Systems FGCS92 (ICOT, 1992) 570-580.
18. G. Brewka. An abductive framework for generalized logic programs, in: L.M. Pereira and A. Nerode, eds., Proc. 2nd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, MA, 1993) 349-364.
19. G. Brewka and K. Konolige, An abductive framework for general logic programs and other nonmonotonic systems, Proc. Internat. Joint Conf. on Artificial Intelligence IJCAI93 (AAAI, 1993) 9-15.
20. A. Brogi, E. Lamma, P. Mancarella and P. Mello, Normal logic programs as open positive programs, in: K. Apt, ed., Proc. Internat. Joint Conf. and Symp. on Logic Programming (MIT Press, Cambridge, MA, 1992) 783-797.
21. A. Brogi, E. Lamma, P. Mancarella and P. Mello, An abductive framework for extended logic programming, in: Proc. 3rd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Computer Science, LNAI Series, Vol. 928 (Springer, Berlin, 1995) 330-343.
22. A. Brogi, E. Lamma and P. Mello, Compositional model-theoretic semantics for logic programs, in: New Generation Comput. 11 (Springer, Berlin, 1992) 1-21.
23. A. Brogi and F. Turini, Fully abstract compositional semantics for an algebra of logic programs, Theoret. Comput. Sci. 149 (1995) 201-229.
24. M. Bugliesi, E. Lamma and P. Mello, Modularity in logic programming, J. Logic Programming 19-20 (Amsterdam, 1994) 443-502.
25. W. Chen and D.H. Warren, Abductive logic programming, Technical Report, Dept. of Computer Science, State University of New York, 1989.
26. K.L. Clark, Negation as failure, in: H. Gallaire and J. Minker, eds., Logic and Databases (Plenum Press, New York, 1978).
27. L. Console, D. Theseider Duprè and P. Torasso, Abductive reasoning through direct deduction from completed domains models, in: Methodologies for Intelligent Systems, Vol. 4 (North Holland, Amsterdam, 1989) 175.
28. P.T. Cox, and T. Pietrzykowski, Causes for events: their computation and applications, in: Proc. CADE-86 (1986) 608.
29. C.V. Damasio Paraconsistent Logic Programming with Constraints. Ph. D. Thesis. Universidade Nova de Lisboa, 1996.
30. C.V. Damasio and L.M. Pereira, Abduction over 3-valued extended logic programs, in: Proc. 3rd Internat. Workshop on Logic Programming and Non Monotonic Reasoning, Lecture Notes in Computer Science, LNAI Series, Vol. 928 (Springer, Berlin, 1995) 29-42.
31. M. Denecker and D. De Schreye, SLDNFA: an Abductive procedure for normal abductive programs. in: K. Apt, ed., Proc. Int. Joint Conf. and Symp. on Logic Programming, 686-700. The MIT Press, (1992).
32. M Denecker and D. De Schreye, Representing incomplete knowledge in abductive logic programming, in: Proc. Internat. Logic Programming Symp. ILPS93 (MIT Press, Cambridge, MA, 1993) 147-163.
33. J. Dix, Semantics of logic programs: their intuitions and formal properties, in: A. Fuhrmann and H. Roth, eds., Logic, Action and Information (de Gruyter, Berlin, 1994).
34. J. Doyle, A truth maintenance system, Artificial Intelligence 12 (1979) 231-272.
35. P.M. Dung, Negation as hypothesis: an abductive foundation for logic programming, in: K. Furukawa, ed., Proc. 8th Internat. Conf. on Logic Programming ICLP91 (MIT Press, Cambridge, MA, 1991) 3-17.
36. P.M. Dung, On the Relations between stable and well-founded semantics of logic programs, Theoret. Comput. Sci. 105 (1992) 7-25.
37. P.M. Dung, On the acceptability of arguments and its fundamental role in non-monotonic reasoning, in: Proc. Internat. Joint Conf. on Artificial Intelligence IJCAI93 (AAAI, 1993) 852-857.
38. P.M. Dung, An argumentation semantics for logic programming with explicit negation, in: D.S. Warren, ed., Proc. 10th Internat. Conf. on Logic Programming ICLP93 (MIT Press, Cambridge, MA, 1993) 616-630.
39. P.M. Dung, On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming and N-persons games, Artificial Intelligence 77 (1995) 321-352.
40. P.M. Dung, An argumentation-theoretic foundation for logic programming, Logic Programming 22 (1995) 151-171.
41. P.M. Dung and P. Ruamviboonsuk, Well-founded reasoning with classical negation, in: Proc. 1st Internat. Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, MA, 1991) 120-132.
42. K. Eshghi and R.A. Kowalski, Abduction compared with negation by failure, in: G. Levi and M. Martelli, eds., Proc. 6th Internat. Conf. on Logic Programming ICLP89 (MIT Press, Cambridge, MA, 1989) 234-254.
43. C. Evans, Negation-as-failure as an approach to the Hanks and McDermott Problem, in: Proc. 2nd Internat. Symp. on Artificial Intelligence (Monterrey, Mexico, 1989).
44. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski and K.A. Bowen, eds., Proc. 5th Internat. Conf. on Logic Programming (MIT Press, Cambridge, MA, 1988) 1070-1080.
45. M. Gelfond and V. Lifschitz, Logic programs with classical negation, in: D.H.D. Warren and P. Szeredi, eds., Proc. 7th Internat. Conf. on Logic Programming ICLP90 (MIT Press, Cambridge, MA, 1990) 579-597.
46. M. Gelfond and V. Lifschitz, Representing actions in extended logic programming, in: K. Apt, ed., Proc. Internat. Joint Conf. and Symp. on Logic Programming (MIT Press, Cambridge, MA, 1992) 559-573.
47. A.C. Kakas, R.A. Kowalski and F. Toni, Abductive logic programming, J. Logic and Comput. 2 (1993) 719-770.
48. A.C. Kakas and P. Mancarella, Generalized stable models: a semantics for abduction, in: Proc. 9th European Conf. on Artificial Intelligence ECAI90 (Pitman, London, 1990) 385-391.
49. A.C. Kakas and P. Mancarella, On the relation between truth maintenance and abduction, in: Proc. PRICAI90 (1990).
50. A.C. Kakas and P. Mancarella, Preferred extensions are partial stable models, J. Logic Programming 14 (North-Holland, Amsterdam, 1992) 341-348.
51. A.C. Kakas and P. Mancarella, Stable theories for logic programs, in: Proc. Internat. Symp. of Logic Programming (MIT Press, Cambridge, MA, 1991) 85-100.
52. R.A. Kowalski, Problems and promises of computational logic, in: J.W. Lloyd, ed., Computational Logic - Symp. Proc. (Springer, Berlin, 1990) 1-36.
53. K. Inoue, Extended logic programs with default assumptions, in: K. Furukawa, ed., Proc. 8th Internat. Conf. on Logic Programming ICLP91 (MIT Press, Cambridge, MA, 1991) 490-504.
54. M. Maher, Equivalences of logic programs, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988) 627-658.
55. P. Mancarella and D. Pedreschi, An algebra of logic programs, in: R.A. Kowalski and K.A. Bowen, eds., Proc. Fifth Internat. Conf. and Symp. on Logic Programming (MIT Press, Cambridge, MA, 1988) 1006-1023.
56. L.M. Pereira and J.J. Alferes, Well founded semantics for logic programs with explicit negation, in: Proc. ECAI92 (Wiley, New York, 1992) 102-106.
57. L.M. Pereira, J.J. Alferes and J.N. Aparicio, Contradiction removal within well-founded semantics, in: Proc. 1st Internat. Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, MA, 1991) 105-119.
58. L.M. Pereira, J.J. Alferes and J.N. Aparicio, Contradiction removal semantics with explicit negation, in: M. Masuch, J.N. Aparicio and J.J. Alferes, eds., Knowledge Representation and Reasoning under Uncertainty, Lecture Notes in Artificial Intelligence, Vol. 808, (Springer, Berlin, 1994) 91-106.
59. L.M. Pereira, J.N. Aparicio and J.J. Alferes, Derivation procedures for extended stable models, in: Proc. IJCAI91 (Morgan Kaufman, Los Altos, CA, 1991) 863-868.
60. L.M. Pereira, J.N. Aparicio and J.J. Alferes, Non-monotonic reasoning with logic programming, J. Logic Programming 17 (1993) 227-263.
61. L.M. Pereira, C. Damasio and J.J. Alferes, Debugging by diagnosing assumptions, in: P.A. Fritzson, ed., Proc. Automatic Algorithmic Debugging AADEBUG93, Lecture Notes in Computer Science, Vol. 749 (Springer, Berlin, 1993) 58-74.
62. S.O. Pimentel and W.L. Rodi, Belief revision and paraconsistency in a logic programming framework, in: Proc. 1st Internat. Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, MA, 1991) 228-242.
63. D. Poole, Compiling a default reasoning system into prolog, in: New Generation Comput. 9 (Springer, Berlin, 1991) 3-38.
64. T.C. Przymusinski, Extended stable semantics for normal and disjunctive programs, in: D.H.D. Warren and P. Szeredi, eds., Proc. 7th Internat. Conf. on Logic Programming (MIT Press, Cambridge, MA, 1990) 459-477.
65. T.C. Przymusinski, Semantics of disjunctive logic programs and deductive databases, in: Proc. DOOD'91 (1991).
66. F. Sadri and R.A Kowalski, A theorem-proving approach to database integrity, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan-Kaufmann, Los Altos, CA, 1988) 313-362.
67. C. Sakama, Extended well-founded semantics for paraconsistent logic programs, in: Proc. Internat. Conference on Fifth Generation Computer Systems FGCS92 (ICOT, 1992) 592-599.
68. K. Satoh and N. Iwayama, A query evaluation method for abductive logic programming in: K. Apt, ed., Proc. Internat. Joint Conf. and Symp. on Logic Programming (MIT Press, Cambridge, MA, 1992) 671-685.
69. D. Saccà and C. Zaniolo, Stable models and non-determinism for logic programs with negation, Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems (1990) 205-217
70. A. Sørli, Algorithms for treating abductive logic programming based on stable model semantics, ERASMUS Thesis, University of Bologna (1993).
71. F. Teusink, A proof procedure for extended logic programs, in: Proc. Internat. Logic Programming Symp. ILPS93 (MIT Press, Cambridge, MA, 1993) 235-249.
72. A. Van Gelder, K.A. Ross and J.S. Schlipf, Unfounded sets and the well-founded semantics for general logic programs, in: Proc. ACM SIGMOD-SIGACT, Symp. on Principles of Database Systems (1988).
73. J.H. You and L.Y Yuan, On the equivalence of semantics for normal logic programs, J. Logic Programming 22 (1995) 211-222.