Any-world assumptions in logic programming

Theoretical Computer Science

Volumn 342, Issue 2-3, 2005, Pages 351-381

  Loyer, Yann ^a   Straccia, Umberto ^b  

^a UNIVERSITY OF VERSAILLES   (France)

^b ISTI CNR   (Italy)

Author keywords

Bilattices; Default reasoning; Logic programming

Indexed keywords

COMPUTER SCIENCE; FORMAL LOGIC; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; SEMANTICS;

BILATTICES; DEFAULT REASONING; INFORMATION REPRESENTATION; OPEN WORLD ASSUMPTION (OWA);

LOGIC PROGRAMMING;

EID: 23944512745     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.04.005     Document Type: Article

References (50)

1. J. Alcantâra, C.V. Damásio, L.M. Pereira, Paraconsistent logic programs, in: Proc. of the 8th European Conf. on Logics in Artificial Intelligence (JELIA-02), Lecture Notes in Computer Science, Vol. 2424, Cosenza, Italy, 2002, Springer, pp. 345-356.
2. J.J. Alferes, L.M. Pereira, On logic program semantics with two kinds of negation, in: Proc. of the Joint Internat. Conf. and Symp. on Logic Programming, Washington, USA, 1992, The MIT Press, Cambridge, MA, pp. 574-588.
3. O. Arieli Paraconsistent declarative semantics for extended logic programs Ann. Math. Artificial Intelligence 36 4 2002 381 417
4. O. Arieli, and A. Avron Reasoning with logical bilattices J. Logic, Language and Information 5 1 1996 25 63
5. O. Arieli, and A. Avron The value of the four values Artificial Intelligence J. 102 1 1998 97 141
6. N.D. Belnap A useful four-valued logic G. Epstein J.M. Dunn Modern Uses of Multiple-valued Logic 1977 Reidel Dordrecht, NL 5 37
7. H. Blair, and V.S. Subrahmanian Paraconsistent logic programming Theoret. Comput. Sci. 68 1989 135 154
8. K.L. Clark Negation as failure H. Gallaire J. Minker Logic and Data Bases 1978 Plenum Press New York, NY 293 322
9. C.V. Damásio, and L.M. Pereira A survey of paraconsistent semantics for logic programs D. Gabbay P. Smets Handbook of Defeasible Reasoning and Uncertainty Management Systems 1998 Kluwer 241 320
10. C.V. Damásio, L.M. Pereira, Antitonic logic programs, in: Proc. of the 6th European Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR-01), Lecture Notes in Computer Science, Vol. 2173, Springer, 2001.
11. M. Denecker, V.W. Marek, M. Truszczyński, Approximating operators, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning, in: J. Minker, (Ed.), NFS-workshop on Logic-based Artificial Intelligence, 1999, pp. 1-26.
12. M. Denecker, V.W. Marek, M. Truszczyński, Ultimate approximations in nonmonotonic knowledge representation systems, in: D. Fensel, F. Giunchiglia, D. McGuinness, M. Williams (Eds.), Principles of Knowledge Representation and Reasoning: Proc. of the 8th Internat. Conf. Morgan Kaufmann, 2002, pp. 177-188.
13. M. Denecker, V.W. Marek, and M. Truszczyński Uniform semantic treatment of default and autoepistemic logics Artificial Intelligence J. 143 2003 79 122
14. J. Doyle, and D. McDermott Nonmonotonic logic I Artificial Intelligence 13 1980 41 72
15. M.C. Fitting The family of stable models J. Logic Programming 17 1993 197 225
16. M.C. Fitting Fixpoint semantics for logic programming - a survey Theoret. Comput. Sci. 21 3 2002 25 51
17. M. Fitting A Kripke-Kleene-semantics for general logic programs J. Logic Programming 2 1985 295 312
18. M. Fitting Bilattices and the semantics of logic programming J. Logic Programming 11 1991 91 116
19. M. Fitting Kleene's logic, generalized J. Logic and Computation 1 6 1992 797 810
20. M. Gelfond, and V. Lifschitz The stable model semantics for logic programming R.A. Kowalski K. Bowen Proc. of the 5th Internat. Conf. on Logic Programming Cambridge, Massachusetts 1988 The MIT Press Cambridge 1070 1080
21. M. Gelfond, and V. Lifschitz Classical negation in logic programs and disjunctive databases New Generation Comput. 9 3/4 1991 365 386
22. M.L. Ginsberg, (Eds.), Readings in Nonmonotonic Reasoning, Morgan Kaufmann, Los Altos, CA, 1987.
23. M.L. Ginsberg Multi-valued logics: a uniform approach to reasoning in artificial intelligence Computational Intelligence 4 1988 265 316
24. R. Hähnle, and G. Escalada-Imaz Deduction in many-valued logics: a survey Mathware and Soft Comput. IV 2 1997 69 97
25. J. Han, and M. Kamber Data Mining: Concepts and Techniques 2000 Morgan Kaufmann San Francisco, USA
26. K. Inoue Hypothetical reasoning in logic programs J. Logic Programming 18 1994 191 227
27. M. Kifer, and V.S. Subrahmanian Theory of generalized annotated logic programming and its applications J. Logic Programming 12 1992 335 367
28. L.V.S. Lakshmanan, and N. Shiri A parametric approach to deductive databases with uncertainty IEEE Trans. Knowledge and Data Engng 13 4 2001 554 570
29. N. Lavrac, and S. Dzeroski Inductive Logic Programming: Techniques and Applications 1994 Ellis Horwood New York
30. N. Leone, P. Rullo, and F. Scarcello Disjunctive stable models: unfounded sets, fixpoint semantics, and computation Information and Comput. 135 2 1997 69 112
31. N. Loyer, Y. Spyratos, and D. Stamate Parametrized semantics of logic programs - a unifying framework Theoret. Comput. Sci. 308 1-3 2003 429 447
32. Y. Loyer, N. Spyratos, and D. Stamate Hypotheses-based semantics of logic programs in multi-valued logics ACM Trans. Computational Logic 15 3 2004 508 527
33. Y. Loyer, U. Straccia, Uncertainty and partial non-uniform assumptions in parametric deductive databases, in: Proc. of the 8th European Conf. on Logics in Artificial Intelligence (JELIA-02), Lecture Notes in Computer Science, Vol. 2424, Cosenza, Italy, Springer, 2002, pp. 271-282.
34. Y. Loyer, U. Straccia, The well-founded semantics in normal logic programs with uncertainty, in: Proc. of the 6th Internat. Symp. on Functional and Logic Programming (FLOPS-2002), Lecture Notes in Computer Science, Vol. 2441, Aizu, Japan, 2002, Springer, pp. 152-166.
35. Y. Loyer, U. Straccia, The approximate well-foundedsemantics for logic programs with uncertainty, in: 28th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS-2003), Lecture Notes in Computer Science, Vol. 2747, Bratislava, Slovak Republic, 2003, Springer, pp. 541-550.
36. Y. Loyer, U. Straccia, Default knowledge in logic programs with uncertainty, in: Proc. of the 19th Internat. Conf. on Logic Programming (ICLP-03), Lecture Notes in Computer Science, Vol. 2916, Mumbai, India, 2003, Springer, pp. 466-480.
37. Y. Loyer, U. Straccia, An epistemic foundation of stable model semantics, Technical Report ISTI-2003-TR-11, Istituto di Scienza e Tecnologie dell'Informazione, Consiglio Nazionale delle Ricerche, Pisa, Italy, 2003.
38. Y. Loyer, U. Straccia, Epistemic foundation of the well-founded semantics over bilattices, in: 29th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS-2004), Lecture Notes in Computer Science, Vol. 3153, Bratislava, Slovak Republic, 2004, Springer, pp. 513-524.
39. V.W. Marek, and M. Truszczyński Autoepistemic logic J. ACM 38 3 1991 587 618
40. J. McCarthy Circumscription - a form of nonmonotonic reasoning Artificial Intelligence 13 1980 27 39
41. J. McCarthy Applications of circumscription to formalizing commonsense knowledge Artificial Intelligence 28 1986 89 116
42. D. McDermott Nonmonotonic logic II J. ACM 22 1982 33 57
43. R.C. Moore, Possible-world semantics for autoepistemic logic, in: Proc. of the 1st Internat. Workshop on Nonmonotonic Reasoning, New Paltz, NY, 1984, pp. 344-354.
44. R.C. Moore Semantical considerations on nonmonotonic logic Artificial Intelligence 25 1985 75 94
45. S. Muggleton, and L. De Raedt Inductive logic programming: theory and methods J. Logic Programming 19/20 1994 629 679
46. R. Reiter On closed world data bases H. Gallaire J. Minker Logic and Data Bases 1978 Plenum Press New York, NY 55 76
47. R. Reiter A logic for default reasoning Artificial Intelligence 13 1980 81 132
48. C. Sakama, Induction from answer sets in nonmonotonic logic programs, ACM Trans. Computational Logic (TOCL), 2004.
49. A. Tarski A lattice-theoretical fixpoint theorem and its applications Pacific J. Math. (5) 1955 285 309
50. A. van Gelder, K.A. Ross, and J.S. Schlimpf The well-founded semantics for general logic programs J. ACM 38 3 1991 620 650