Logic programs with annotated disjunctions

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

Volumn 3132, Issue , 2004, Pages 431-445

  Vennekens, Joost ^a   Verbaeten, Sofie ^a   Bruynooghe, Maurice ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; PROBABILISTIC LOGICS; PROBABILITY DISTRIBUTIONS; RECONFIGURABLE HARDWARE; SEMANTICS;

DISJUNCTIVE LOGIC PROGRAMS; HERBRAND INTERPRETATIONS; HORN CLAUSE; LOGIC PROGRAMS; POSSIBLE WORLD SEMANTICS; RELATED WORKS;

LOGIC PROGRAMMING;

EID: 35048837074     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_30     Document Type: Article

References (26)

1. K.R. Apt and M. Bezem. Acyclic programs. New Generation Computing, 9:335-363, 1991.
2. F. Bacchus. Using first-order probability logic for the construction of bayesian networks. In Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, pages 219-226, 1993.
3. C. Baral, M. Gelfond, and N. Rushton. Probabilistic reasoning with answer sets. In Proc. Logic Programming and Non Monotonic Reasoning, LPNMR'04, pages 21-33. Springer-Verlag, 2004.
4. J.S. Breese, R.P. Goldman, and M.P. Wellman. Introduction to the special section on knowledge-based construction of probabilistic and decision models. IEEE Transactions on Systems, Man, and Cybernetics, 24(11):1577-1579, 1994.
5. G. Brewka. Logic programming with ordered disjunction. In Proceedings of the 18th National Conference on Artificial Intelligence, AAAI-2002. Morgan Kaufmann, 2002., pages 100-105, 2002.
6. J. Cussens. Stochastic logic programs: Sampling, inference and applications. In Proceedings of the Sixteenth Annual Conference on Uncertainty in Artificial Intelligence, pages 115-122. MK, 2000.
7. A. Dekhtyar and V.S. Subrahmanian. Hybrid probabilistic programs. Journal of Logic Programming, 43(3):187-250, 2000.
8. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New generation computing, 9:365-385, 1991.
9. L. Getoor, N. Friedman, D. Koller, and A. Pfeffer. Learning Probabilistic Relational Models. In S. Dzeroski and N. Lavrac, editors, Relational Data Mining, pages 7-34. Springer-Verlag, 2001. to appear.
10. J. Y. Halpern. Reasoning about uncertainty. MIT press, 2003.
11. J.Y. Halpern. An analysis of first-order logics of probability. Artificial Intelligence, 46:311-350, 1989.
12. K. Kersting and L. De Raedt. Bayesian logic programs. In J. Cussens and A. Frisch, editors, Work-in-Progress Reports of the Tenth International Conference on Inductive Logic Programming (ILP-2000), 2000.
13. L.V.S. Lakshmanan and F. Sadri. Probabilistic deductive databases. In M. Bruynooghe, editor, Proceedings of the International Symposium on Logic Programming, pages 254-268. MIT Press, 1994.
14. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
15. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.
16. T. Lukasiewicz. Fixpoint characterizations for many-valued disjunctive logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), volume 2173 of Lecture Notes in Artificial Intelligence, pages 336-350. Springer-Verlag, 2001.
17. S. Muggleton. Learning stochastic logic programs. Electronic Transactions in Artificial Intelligence, 5(041), 2000.
18. R.T. Ng and V.S. Subrahmanian. Probabilistic logic programming. Information and Computation, 101(2):150-201, 1992.
19. L. Ngo and P. Haddawy. Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science, 171(1-2):147-177, 1997.
20. D. Poole. The Independent Choice Logic for modelling multiple agents under uncertainty. Artificial Intelligence, 94(1-2):7-56, 1997.
21. C. Sakama. Possible model semantics for disjunctive databases II (extended abstract). In Logic Programming and Non-monotonic Reasoning, pages 107-114, 1990.
22. C. Sakama and K. Inoue. On the equivalence between disjunctive and abductive logic programs. In International Conference on Logic Programming, pages 489-503, 1994.
23. T. Sato and Y. Kameya. PRISM: A language for symbolic-statistical modeling. Proceedings of IJCAI 97, pages 1330-1335, 1997.
24. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3):620-650, 1991.
25. J. Vennekens and S. Verbaeten. A general view on probabilistic logic programming. In Proceedings of the 15th Belgian-Dutch Conference on Artificial Intelligence, pages 299-306, 2003. http://www.cs.kuleuven.ac.be/joost/bnaic.ps.
26. J. Vennekens and S. Verbaeten. Logic programs with annotated disjunctions. Technical Report CW386, K.U. Leuven, 2003. http://www.cs.kuleuven. ac.be/joost/techrep.ps.