The approximate well-founded semantics for logic programs with uncertainty

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 541-550

  Loyer, Yann ^a   Straccia, Umberto ^b  

^a UNIVERSITY OF VERSAILLES   (France)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT DATABASES; SEMANTICS;

CLOSED WORLD ASSUMPTION; DEDUCTIVE DATABASE; IMPORTANT FEATURES; INCOMPLETE KNOWLEDGE; LOGIC PROGRAMS; REAL-WORLD INFORMATION; UNCERTAIN INFORMATIONS; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 35248856977     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_48     Document Type: Article

References (19)

1. N. D. Belnap. How a computer should think. In Gilbert Ryle, editor, Contemporary aspects of philosophy, pages 30-56. Oriel Press, Stocksfield, GB, 1977.
2. D. Dubois, J. Lang, and H. Prade. Towards possibilistic logic programming. In Proc. of the 8th Int. Conf. on Logic Programming (ICLP-91), pages 581-595, 1991.
3. M. Fitting. The family of stable models. J. of Logic Programming, 17:197-225, 1993.
4. M. Fitting. A Kripke-Kleene-semantics for general logic programs. J. of Logic Programming, 2:295-312, 1985.
5. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th Int. Conf. on Logic Programming, pages 1070-1080, 1988.
6. M. L. Ginsberg. Multi-valued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4:265-316, 1988.
7. M. Kifer and A. Li. On the semantics of rule-based expert systems with uncertainty. In Proc. of the Int. Conf. on Database Theory (ICDT-88), in LNCS 326, pages 102-117, 1988.
8. M. Kifer and V.S. Subrahmanian. Theory of generalized annotaded logic programming and its applications. J. of Logic Programming, 12:335-367, 1992.
9. L. V.S. Lakshmanan and N. Shiri. Probabilistic deductive databases. In Int. Logic Programming Symposium, pages 254-268, 1994.
10. L. V.S. Lakshmanan and N. Shiri. A parametric approach to deductive databases with uncertainty. IEEE Transactions on Knowledge and Data Engineering, 13(4):554-570, 2001.
11. Y. Loyer and U. Straccia. The well-founded semantics in normal logic programs with uncertainty. In Proc. of the 6th Int. Symposium on Functional and Logic Programming (FLOPS-2002), in LNCS 2441, pages 152-166, 2002.
12. Y. Loyer and U. Straccia. The well-founded semantics of logic programs over bilattices: an alternative characterisation. Technical Report ISTI-2003-TR-05, Istituto di Scienza e Tecnologie dell'Informazione, Consiglio Nazionale delle Ricerche, Pisa, Italy, 2003. Submitted.
13. T. Lukasiewicz. Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics, in LNCS, 2173, pages 336-350, 2001.
14. R. Ng and V.S. Subrahmanian. Stable model semantics for probabilistic deductive databases. In Proc. of the 6th Int. Symposium on Methodologies for Intelligent Systems (ISMIS-91), in LNAI 542, pages 163-171, 1991.
15. R. Ng and V.S. Subrahmanian. Probabilistic logic programming. Information and Computation, 101(2):150-201, 1993.
16. E. Y. Shapiro. Logic programs with uncertainties: A tool for implementing rule-based systems. In Proc. of the 8th Int. Joint Conf. on Artificial Intelligence (IJCAI-83), pages 529-532, 1983.
17. M.H. van Emden. Quantitative deduction and its fixpoint theory. J. of Logic Programming, 4(1):37-53, 1986.
18. A. van Gelder, K. A. Ross, and J. S. Schlimpf. The well-founded semantics for general logic programs. J. of the ACM, 38(3):620-650, January 1991.
19. G. Wagner. Negation in fuzzy and possibilistic logic programs. In T. Martin and F. Arcelli, editors, Logic programming and Soft Computing. Research Studies Press, 1998.