Probabilistic Logic Programming with Conditional Constraints

ACM Transactions on Computational Logic

Volumn 2, Issue 3, 2001, Pages 289-339

  Lukasiewicz, Thomas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Algorithms; Computational complexity; conditional constraint; Languages; logic programming; many valued logic; probabilistic logic; probabilistic logic programming; probabilistic reasoning; probability; quantitative deduction; Theory; uncertainty

Indexed keywords

EID: 0010842519     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/377978.377983     Document Type: Article

References (69)

1. Amarger, S., Dubois, D., and Prade, H. 1991. Constraint propagation with imprecise conditional probabilities. In Proceedings of the 7th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Mateo, CA, 26-34.
2. Andersen, K. A. and Hooker, J. N. 1994. Bayesian logic. Decision Support Systems 11, 191-210.
3. Apt, K. R. 1990. Logic programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B. MIT Press, Cambridge, MA, Chapter 10, 493-574.
4. Bacchus, F., Grove, A., Halpern, J. Y., and Koller, D. 1996. From statistical knowledge bases to degrees of belief. Artif. Intell. 87, 75-143.
5. Baldwin, J. F. 1987. Evidential support logic programming. Fuzzy Sets Syst. 24, 1-26.
6. Biazzo, V. and Gilio, A. 2000. A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments. Int. J. Approx. Reasoning 24, 251-272.
7. Blair, H. A. and Subrahmanian, V. S. 1989. Paraconsistent logic programming. Theor. Comput. Sci. 68, 135-154.
8. Carnap, R. 1950. Logical Foundations of Probability. University of Chicago Press, Chicago.
9. Charnes, A. and Cooper, W. W. 1962. Programming with linear fractional functionals. Naval Research Logistics Quaterly 9, 181-186.
10. ChvAtal, V. 1983. Linear Programming. Freeman, San Francisco.
11. Dantsin, E., Eiter, T., Gottlob, G., and Voronkov, A. 1997. Complexity and expressive power of logic programming. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity. IEEE Computer Society, 82-101.
12. de Finetti, B. 1974. Theory of Probability. J. Wiley, New York.
13. Dekhtyar, A. and Subrahmanian, V. S. 1997. Hybrid probabilistic programs. In Proceedings of the 14th International Conference on Logic Programming. MIT Press, Cambridge, MA, 391-405.
14. Dekhtyar, M. I., Dekhtyar, A., and Subrahmanian, V. S. 1999. Hybrid probabilistic programs: Algorithms and complexity. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Francisco, CA, 160-169.
15. Dowling, W. F. and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Program. 1, 3, 267-284.
16. Dubois, D., Prade, H., Godo, L., and de Mantaras, R. L. 1993. Qualitative reasoning with imprecise probabilities. Journal of Intelligent Information Systems 2, 319-363.
17. Dubois, D., Prade, H., and Touscas, J.-M. 1990. Inference with imprecise numerical quantifiers. In Intelligent Systems, Z. W. Ras and M. Zemankova, Eds. Ellis Horwood, Chichester, Chapter 3, 53-72.
18. Fagin, R., Halpern, J. Y., and Megiddo, N. 1990. A logic for reasoning about probabilities. Inf. Comput. 87, 78-128.
19. Fitting, M. 1991. Bilattices and the semantics of logic programming. J. Logic Program. 11, 1-2, 91-116.
20. Frisch, A. M. and Haddawy, P. 1994. Anytime deduction for probabilistic logic. Artif. Intell. 69, 93-122.
21. Gaifman, H. 1964. Concerning measures in first order calculi. Israel J. Math. 2, 1-18.
22. Ganter, B. 1987. Algorithmen zur Formalen Begriffsanalyse. In Beitrage zur Begriffsanalyse, B. Ganter, R. Wille, and K. Wolff, Eds. B. I.-Wissenschaftsverlag, Mannheim, 241-254.
23. Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.
24. Georgakopoulos, G., Kavvadias, D., and Papadimitriou, C. H. 1988. Probabilistic satisfiability. J. Complexity 4, 1, 1-11.
25. Goldfarb, D. and Todd, M. J. 1989. Linear programming. In Optimization, G. L. Nemhauser, A. H. G. R. Kan, and M. J. Todd, Eds. Handbooks in Operations Research and Management Science, vol. 1. Elsevier Science, Amsterdam, Chapter 2, 73-170.
26. Haddawy, P. 1994. Generating Bayesian networks from probability logic knowledge bases. In Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Francisco, CA, 262-269.
27. Hahnle, R. 1996. Exploiting data dependencies in many-valued logics. J. Appl. Non-Class. Log. 6, 1, 49-69.
28. Hailperin, T. 1986. Boole's logic and probability. North-Holland, Amsterdam, 2nd ed.
29. Halpern, J. Y. 1990. An analysis of first-order logics of probability. Artif. Intell. 46, 311-350.
30. Jaeger, M. 1997. Relational Bayesian networks. In Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Francisco, CA, 266-273.
31. Jaeger, M. 1999. On the complexity of inference about probabilistic relational models. Artif. Intell. 117, 297-308.
32. Jaumard, B., Hansen, P., and de AragAo, M. P. 1991. Column generation methods for probabilistic logic. ORSA J. Comput. 3, 135-147.
33. Johnson, D. S. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. A. MIT Press, Cambridge, MA, Chapter 2, 67-161.
34. Kavvadias, D. and Papadimitriou, C. H. 1990. A linear programming approach to reasoning about probabilities. Ann. Math. Artif. Intell. 1, 189-205.
35. Kifer, M. and Subrahmanian, V. S. 1992. Theory of generalized annotated logic programming and its applications. J. Logic Program. 12, 3-4, 335-367.
36. Kowalski, R. A. 1974. Predicate logic as a programming language. In Information Processing '74. North-Holland, Amsterdam, 569-574.
37. Lakshmanan, L. V. S. and Sadri, F. 1994. Probabilistic deductive databases. In Proceedings of the International Logic Programming Symposium. MIT Press, Cambridge, MA, 254-268.
38. Leach, S. M. and Lu, J. J. 1996. Query processing in annotated logic programming: Theory and implementation. Journal of Intelligent Information Systems 6, 1, 33-58.
39. Lloyd, J. W. 1987. Foundations of Logic Programming. Springer, Berlin, 2nd ed.
40. Lu, J. J. 1996. Logic programming with signs and annotations. J. Log. Comput. 6, 6, 755-778.
41. Lukasiewicz, T. 1997. Efficient global probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. In Proceedings of the 6th International Conference on Information and Knowledge Management. ACM Press, 75-82.
42. Lukasiewicz, T. 1998. Probabilistic logic programming. In Proceedings of the 13th European Conference on Artificial Intelligence. J. Wiley & Sons, Chichester, 388-392.
43. Lukasiewicz, T. 1999a. Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. Int. J. Approx. Reasoning 21, 1, 23-61.
44. Lukasiewicz, T. 1999b. Many-valued disjunctive logic programs with probabilistic semantics. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning. LNAI, vol. 1730. Springer, Berlin, 277-289.
45. Lukasiewicz, T. 1999c. Many-valued first-order logics with probabilistic semantics. In Proceedings of the Annual Conference of the European Association for Computer Science Logic. LNCS, vol. 1584. Springer, Berlin, 415-429.
46. Lukasiewicz, T. 1999d. Probabilistic and truth-functional many-valued logic programming. In Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic. IEEE Computer Society, 236-241.
47. Lukasiewicz, T. 1999e. Probabilistic deduction with conditional constraints over basic events. J. Artif. Intell. Res. 10, 199-241.
48. Lukasiewicz, T. 2000a. Credal networks under maximum entropy. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Francisco, CA, 363370.
49. Lukasiewicz, T. 2000b. Probabilistic default reasoning with conditional constraints. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, Special Session on Uncertainty Frameworks in NMR.
50. Lukasiewicz, T. and Kern-Isberner, G. 1999. Probabilistic logic programming under maximum entropy. In Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. LNAI, vol. 1638. Springer, Berlin, 279-292.
51. Ng, R. T. 1997. Semantics, consistency, and query processing of empirical deductive databases. IEEE Trans. Knowl. Data Eng. 9, 1, 32-49.
52. Ng, R. T. and Subrahmanian, V. S. 1992. Probabilistic logic programming. Inf. Comput. 101, 150-201.
53. Ng, R. T. and Subrahmanian, V. S. 1993. A semantical framework for supporting subjective and conditional probabilities in deductive databases. J. Autom. Reasoning 10, 2, 191-235.
54. Ng, R. T. and Subrahmanian, V. S. 1994. Stable semantics for probabilistic deductive databases. Inf. Comput. 110, 42-83.
55. Ngo, L. and Haddawy, P. 1997. Answering queries from context-sensitive probabilistic knowledge bases. Theor. Comput. Sci. 171, 147-177.
56. Nilsson, N. J. 1986. Probabilistic logic. Artif. Intell. 28, 71-88.
57. Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, MA.
58. Papadimitriou, C. H. and Steiglitz, K. 1982. Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, New Jersey.
59. Paris, J. B. 1995. The Uncertain Reasoner's Companion: A Mathematical Perspective. Cambridge University Press, Cambridge, UK.
60. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
61. Poole, D. 1993a. Logic programming, abduction and probability. New Gener. Comput. 11, 377-400.
62. Poole, D. 1993b. Probabilistic Horn abduction and Bayesian networks. Artif. Intell. 64, 81-129.
63. Rescher, N. 1969. Many-valued Logic. McGraw-Hill, New York.
64. Schrijver, A. 1986. Theory of Linear and Integer Programming. J. Wiley, New York.
65. Scott, D. and Krauss, P. 1966. Assigning probabilities to logical formulas. In Aspects of Inductive Logic, J. Hintikka and P. Suppes, Eds. North-Holland, Amsterdam, 219-264.
66. van der Gaag, L. 1991. Computing probability intervals under independency constraints. In Uncertainty in Artificial Intelligence 6. North-Holland, Amsterdam, 457-466.
67. van Emden, M. H. 1986. Quantitative deduction and its fixpoint theory. J. Logic Program. 3, 1, 37-53.
68. Wagner, K. W. 1987. More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci. 51, 53-80.
69. Zadeh, L. A. 1965. Fuzzy sets. Inform. and Control 8, 338-353.