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 1730, Issue , 1999, Pages 277-289

  Lukasiewicz, Thomas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

CLASSICAL COUNTERPART; DISJUNCTIVE LOGIC PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; FUNCTIONAL SEMANTICS; PERFECT MODEL; POSSIBLE WORLDS; PROBABILISTIC SEMANTICS; STABLE MODEL SEMANTICS;

MANY VALUED LOGICS;

EID: 84958598369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46767-X_20     Document Type: Conference Paper

References (31)

1. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 10, pages 493–574. MIT Press, 1990.
2. F. Bacchus, A. Grove, J. Y. Halpern, and D. Koller. From statistical knowledge bases to degrees of beliefs. Artif. Intell., 87:75–143, 1996.
3. J. F. Baldwin. Evidential support logic programming. Fuzzy Sets Syst., 24:1–26, 1987.
4. A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic programs. In Proc. of the 14th International Conference on Logic Programming, pages 391–405, 1997.
5. T. Eiter and G. Gottlob. Complexity aspects of various semantics for disjunctive databases. In Proc. of the 12th ACM Symposium on Principles of Database Systems, pages 158–167. ACM Press, 1993.
6. T. Eiter and G. Gottlob. On the computational cost of disjunctive logic program-ming: Propositional case. Ann. Math. Artif. Intell., 15:289–323, 1995.
7. R. Fagin, J. Y. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Inf. Comput., 87:78–128, 1990.
8. M. Fitting. Bilattices and the semantics of logic programming. J. Logic Program., 11(1–2):91–116, 1991.
9. J. Y. Halpern. An analysis of first-order logics of probability. Artif. Intell., 46:311– 350, 1990.
10. M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. Logic Program., 12(3–4):335–367, 1992.
11. J.-L. Lassez and M. J. Maher. Optimal fixedpoints of logic programs. Theor. Comput. Sci., 39:15–25, 1985.
12. J. W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 2nd ed., 1987.
13. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Program-ming. MIT Press, Cambridge, MA, 1992.
14. T. Lukasiewicz. Probabilistic logic programming. In Proc. of the 13th Biennial European Conf. on Artificial Intelligence, pages 388–392. J. Wiley & Sons, 1998.
15. T. Lukasiewicz. Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. Int. J. Approx. Reas., 21(1):23–61, 1999.
16. T. Lukasiewicz. Many-valued disjunctive logic programs with probabilistic semantics. Technical Report 1843-99-09, Institut für Informationssysteme, Technische Universität Wien, 1999. ftp://ftp.kr.tuwien.ac.at/pub/tr/rr9909.ps.gz.
17. T. Lukasiewicz. Many-valued first-order logics with probabilistic semantics. In Proc. of the Annual Conference of the European Association for Computer Science Logic, 1998, volume 1584 of LNCS, pages 415–429. Springer, 1999.
18. T. Lukasiewicz. Probabilistic and truth-functional many-valued logic program-ming. In Proc. of the 29th IEEE International Symposium on Multiple-Valued Logic, pages 236–241, 1999.
19. T. Lukasiewicz. Probabilistic deduction with conditional constraints over basic events. J. Artif. Intell. Res., 10:199–241, 1999.
20. C. Mateis. A Quantitative Extension of Disjunctive Logic Programming. Doctoral Dissertation, Technische Universität Wien, 1998.
21. J. Minker. Overview of disjunctive logic programming. Ann. Math. Artif. Intell., 12:1–24, 1994.
22. R. T. Ng. Semantics, consistency, and query processing of empirical deductive databases. IEEE Trans. Knowl. Data Eng., 9(1):32–49, 1997.
23. R. T. Ng and V. S. Subrahmanian. A semantical framework for supporting sub-jective and conditional probabilities in deductive databases. J. Autom. Reasoning, 10(2):191–235, 1993.
24. R. T. Ng and V. S. Subrahmanian. Stable semantics for probabilistic deductive databases. Inf. Comput., 110:42–83, 1994.
25. L. Ngo. Probabilistic disjunctive logic programming. In Proc. of the 12th Conf. on Uncertainty in Artificial Intelligence, pages 397–404. Morgan Kaufmann, 1996.
26. N. J. Nilsson. Probabilistic logic. Artif. Intell., 28:71–88, 1986.
27. D. Poole. Probabilistic Horn abduction and Bayesian networks. Artif. Intell., 64:81–129, 1993.
28. 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, pages 193–216. Morgan Kaufmann, 1988.
29. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Comput., 9:401–424, 1991.
30. N. Rescher. Many-valued Logic. McGraw-Hill, New York, 1969.
31. M. H. van Emden. Quantitative deduction and its fixpoint theory. J. Logic Pro-gram., 3(1):37–53, 1986.