Hybrid Probabilistic Logic Programs with non-monotonic negation

Lecture Notes in Computer Science

Volumn 3668, Issue , 2005, Pages 204-220

  Saad, Emad ^a   Pontelli, Enrico ^a  

^a NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ENCODING (SYMBOLS); INFORMATION ANALYSIS; PROBABILISTIC LOGICS; SEMANTICS;

MODEL SEMANTICS; NON-MONOTONIC NEGATION; PROBABILISTIC PROGRAMS; REASONING;

LOGIC PROGRAMMING;

EID: 27144554058     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_17     Document Type: Conference Paper

References (23)

1. K.R. Apt and R.N. Bol. Logic programming and negations survey. Journal of logic programming, 19/20:9-71, 1994.
2. C. Baral et al. Probabilistic reasoning with answer sets. In 7th International Conference on Logic Programming and Nonmonotonic Reasoning, Springer Verlag, 2004.
3. C.V. Damasio and L. Moniz Pereira. Hybrid probabilistic logic programs as residuated logic programs. JELIA, 2000.
4. C.V. Damasio et al. Coherent well-founded annotated logic programs. LPNMR, Springer, 1999.
5. A. Dekhtyar and V.S. Subrahmanian. Hybrid probabilistic program. Journal of Logic Programming, 43(3): 187-250, 2000.
6. W.F. Dowling and J.H. Gallier. Linear-time algorithms for testing the satisfiability of prepositional Horn formulae. Journal of Logic Programming, 1(3): 267-284, 1984.
7. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. ICSLP, 1988, MIT Press.
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. Kifer and V.S. Subrahmanian. Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12:335-367, 1992.
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. L.V.S. Lakshmanan and N. Shiri. A parametric approach to deductive databases with uncertainty. IEEE TKDE, 13(4):554-570, 2001.
13. Y. Loyer and U. Straccia. The well-founded semantics in normal logic programs with uncertainty. FLOPS, 2002, Springer Verlag.
14. Y. Loyer and U. Straccia. The approximate well-founded semantics for logic programs with uncertainty. In 28th International Symposium on Mathematical Foundations of Computer Science, 2003.
15. T. Lukasiewicz. Probabilistic logic programming. In 13th European Conference on Artificial Intelligence, 388-392, 1998.
16. T. Lukasiewicz. Many-valued disjunctive logic programs with probabilistic semantics. LPNMR, 1999.
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. R.T. Ng and V.S. Subrahmanian. Probabilistic logic programming. Information & Computation, 101(2), 1992.
19. R.T. Ng and V.S. Subrahmanian. A semantical framework for supporting subjective and conditional probabilities in deductive databases. ARJ, 10(2), 1993.
20. R.T. Ng and V.S. Subrahmanian. Stable semantics for probabilistic deductive databases. Information & Computation, 110(1), 1994.
21. E. Saad. Hybrid probabilistic programs with non-monotonic negation: semantics and algorithms. Ph.D. thesis, New Mexico State University, May 2005.
22. E. Saad and E. Pontelli. Towards a more practical hybrid probabilistic logic programming framework. In Practical Aspects of Declarative Languages. Springer Verlag, 2005.
23. V.S. Subrahmanian. Amalgamating knowledge bases. ACM TDS, 19(2):291-331, 1994.