Towards the computation of stable probabilistic model semantics

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

Volumn 4314 LNAI, Issue , 2007, Pages 143-158

  Saad, Emad ^a  

^a ABU DHABI UNIVERSITY   (United Arab Emirates)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; PROBABILISTIC LOGICS;

HYBRID PROBABILISTIC LOGIC PROGRAMS; NON MONOTONIC NEGATION; NORMAL HYBRID PROBABILISTIC PROGRAMS (NHPP); STABLE MODEL SEMANTICS;

SEMANTICS;

EID: 35448970530     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-69912-5_12     Document Type: Conference Paper

References (24)

1. C. Baral et al. Probabilistic reasoning with answer sets. In 7th International Conference on Logic Programming and Nonmonotonic Reasoning, Springer Verlag, 2004.
2. C. Bell, A. Nerode, R. Ng, V. S. Subrahmanian. Mixed integer programming methods for computing Nonmonotonic Deductive Databases. Journal of ACM, 41(6): 1178-1215, 1994.
3. W. D. Chen, D. S. Warren. Computation of stable models and its integration with logical query processing. IEEE Transaction on Knowledge and Data Engineering, 8(5): 742-757, 1996.
4. P. Cholewinski, V. Marek, M. Truszczynski, A. Mikitiuk. Computing with default logic. Artificial Intelligence, 112(1-2): 105-146, 1999.
5. A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic program. Journal of Logic Programming, 43(3): 187-250, 2000.
6. M. Dekhtyar, A. Dekhtyar, and V. S. Subrahmanian. Hybrid probabilistic programs: algorithms and complexity. In Uncertainty in Artificial Intelligence Conference, pages 160-169, 1999.
7. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1(3): 267-284, 1984.
8. A. Van. Gelder. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences, 47(1):185-221, 1993.
9. A. Van. Gelder, K. A. Ross, and J. S. Schlipf. The Well-founded semantics for general logic programs. Journal of ACM, 38(3):620-650, 1991.
10. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, In Fifth International Conference and Symposium on Logic Programming, 1070-1080, 1988.
11. L. V.S. Lakshmanan and F. Sadri. On a theory of probabilistic deductive databases. Journal of Theory and Practice of Logic Programming, 1(1):5-42, January 2001.
12. V. Lifschitz. Foundations of logic programming. In Principles of Knowledge Representation, 69-127, CSLI Publications, 1996.
13. J. J. Lu and S. M. Leach. Computing annotated logic programs. In International Conference on Logic Programming, Pascal van Hentenryck, editor, MIT press, Cambridge, MA, 1994.
14. W. Marek and M. Truszczynski. Autoepistemic logic. Journal of ACM, 38(3):588-619, 1991.
15. R. T. Ng and V. S. Subrahmanian. Probabilistic logic programming. Information and Computation, 101(2):150-201, December 1992.
16. R. T. Ng and V. S. Subrahmanian. Stable semantics for probabilistic deductive databases. Information and Computation, 110(1):42-83, 1994.
17. I. Niemela and P. Simons. Efficient implementation of the well-founded and stable model semantics. In Joint International Conference and Symposium on Logic Programming, 289-303, 1996.
18. I. Niemela, P. Simons, T. Soininen. Stable model semantics of weight constraint rules. In Fifth International Conference on Logic Programming and Nonmonotonic Reasoning, 317-331, 1999.
19. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1-2):81-132, 1980.
20. E. Saad. Hybrid probabilistic programs with non-monotonic negation: semantics and algorithms. Ph.D. thesis, New Mexico State University, May 2005.
21. E. Saad and E. Pontelli. Towards a more practical hybrid probabilistic logic programming framework. In Practical Aspects of Declarative Languages. Springer Verlag, 2005.
22. E. Saad and E. Pontelli. Hybrid probabilistic logic programming with non-monotoic negation. In Twenty First International Conference on Logic Programming. Springer Verlag, 2005.
23. V. S. Subrahmanian, D. S. Nau, C. Vago, wfs + branch and bound = stable models. IEEE Transaction on Knowledge and Data Engineering, 7(3): 362-377, 1995.
24. J. Vennekens, S. Verbaeten, and M. Bruynooghe. Logic programs with annotated disjunctions. In International Workshop on Nonmonotonic Reasoning, 2004.