Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics

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

Volumn 2173 LNAI, Issue , 2001, Pages 336-350

  Lukasiewicz, Thomas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DISJUNCTIVE LOGIC PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; FIXPOINTS; MINIMAL MODEL; MODEL STATE; PERFECT MODEL; PROBABILISTIC SEMANTICS; STABLE MODEL;

CHARACTERIZATION; LOGIC PROGRAMMING; PROBABILISTIC LOGICS; SEMANTICS;

MANY VALUED LOGICS;

EID: 84867830547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_25     Document Type: Conference Paper

References (19)

1. A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic programs. In Proceedings ICLP-97, pp. 391-405. MIT Press, 1997.
2. J. A. Ferńandez, J. Lobo, J. Minker, and V. S. Subrahmanian. Disjunctive LP + integrity constraints = stable model semantics. Ann. Math. Artif. Intell., 8(3-4):449-474, 1993.
3. J. A. Ferńandez and J. Minker. Bottom-up computation of perfect models for disjunctive theories. J. Logic Program., 25(1):33-51, 1995.
4. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.
5. T. Lukasiewicz. Many-valued disjunctive logic programs with probabilistic semantics. In Proceedings LPNMR-99, LNCS 1730, pp. 277-289. Springer, 1999.
6. T. Lukasiewicz. Many-valued first-order logics with probabilistic semantics. In Proceedings CSL-98, LNCS 1584, pp. 415-429. Springer, 1999.
7. T. Lukasiewicz. Probabilistic and truth-functional many-valued logic programming. In Proceedings ISMVL-99, pp. 236-241. IEEE Computer Society, 1999.
8. T. Lukasiewicz. Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics. Technical Report INFSYS RR-1843-01-06, Institut für Informationssysteme, TU Wien, 2001.
9. T. Lukasiewicz. Probabilistic logic programming with conditional constraints. ACM Trans. Computat. Logic, 2(3):289-337, 2001.
10. C. Mateis. A Quantitative Extension of Disjunctive Logic Programming. Doctoral Dissertation, Technische Universität Wien, 1998.
11. J. Minker. Overview of disjunctive logic programming. Ann. Math. Artif. Intell., 12:1-24, 1994.
12. J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. J. Logic Program., 9(1):45-74, 1990.
13. R. T. Ng and V. S. Subrahmanian. Stable semantics for probabilistic deductive databases. Inf. Comput., 110:42-83, 1994.
14. L. Ngo. Probabilistic disjunctive logic programming. In Proceedings UAI-96, pp. 397-404. Morgan Kaufmann, 1996.
15. T. C. Przymusinski. On the declarative semantics of stratified deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 193-216. Morgan Kaufmann, 1988.
16. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Comput., 9:401-424, 1991.
17. C. Ruiz and J. Minker. Computing stable and partial stable models of extended disjunctive logic programs. In Nonmonotonic Extensions of Logic Programming, LNCS 927, pp. 205-229. Springer, 1995.
18. D. Seipel, J. Minker, and C. Ruiz. Model generation and state generation for disjunctive logic programs. J. Logic Program., 32(1):49-69, 1997.
19. M. H. van Emden. Quantitative deduction and its fixpoint theory. J. Logic Program., 3(1):37-53, 1986.