Many-valued first-order logics with probabilistic semantics

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

Volumn 1584, Issue , 1999, Pages 415-430

  Lukasiewicz, Thomas ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING; SEMANTICS;

CLASSICAL COUNTERPART; COMPUTATIONAL PROPERTIES; DISJUNCTIVE LOGIC PROGRAMS; FIRST ORDER LOGIC; FIX-POINT SEMANTICS; FUNCTIONAL SEMANTICS; LOGICAL CONSEQUENCES; PROBABILISTIC SEMANTICS;

MANY VALUED LOGICS;

EID: 38949207170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_28     Document Type: Conference Paper

References (35)

1. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 10, pages 493-574. The MIT Press, 1990. 423
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. 426
3. H. A. Blair and V. S. Subrahmanian. Paraconsistent logic programming. Theor. Comput. Sci., 68:135-154, 1989. 427
4. R. Carnap. Logical Foundations of Probability. University of Chicago Press, Chicago, 1950.
5. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. In Proc. of the 12th Annual IEEE Conference on Computational Complexity, pages 82-101, 1997. 425
6. B. de Finetti. Theory of Probability. J. Wiley, New York, 1974.
7. A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic programs. In Proc. of the 14th International Conference on Logic Programming, pages 391-405, 1997.
8. J. P. Delahaye and V. Thibau. Programming in three-valued logic. Theor. Comput. Sci., 78:189-216, 1991. 427
9. G. Escalada-Imaz and F. Manyà. Efficient interpretation of propositional multivalued logic programs. In Proc. 5th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU '94), volume 945 of LNCS, pages 428-439. Springer, 1995. 427
10. R. Fagin, J. Y. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Inf. Comput., 87:78-128, 1990. 426
11. M. Fitting. Partial models and logic programming. Theor. Comput. Sci., 48:229-255, 1986. 427
12. M. Fitting. Bilattices and the semantics of logic programming. J. Logic Program., 11(1-2):91-116, 1991. 427
13. M. Fitting. Many-valued modal logics II. Fundam. Inf., 17:55-73, 1992. 416, 416
14. R. Hahnle. Exploiting data dependencies in many-valued logics. J. Appl. NonClass. Log., 6(1):49-69, 1996. 427
15. J. Y. Halpern. An analysis of first-order logics of probability. Artif. Intell., 46:311-350, 1990. 426, 428
16. M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. Logic Program., 12(3-4):335-367, 1992. 427
17. L. V. S. Lakshmanan and F. Sadri. Probabilistic deductive databases. In Proc. of the International Logic Programming Symposium, pages 254-268, 1994. 427
18. J.-L. Lassez and M. J. Maher. Optimal fixedpoints of logic programs. Theor. Comput. Sci., 39:15-25, 1985. 427, 427, 427
19. S. M. Leach and J. J. Lu. Query processing in annotated logic programming: Theory and implementation. J. Intell. Inf. Syst., 6(1):33-58, 1996. 427
20. J. W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 2nd ed., 1987.
21. J. J. Lu. Logic programming with signs and annotations. J. Log. Comput., 6(6):755-778, 1996. 427, 427
22. T. Lukasiewicz. Magic inference rules for probabilistic deduction under taxonomic knowledge. In Proc. of the 14th Conference on Uncertainty in Artificial Intelligence, pages 354-361. Morgan Kaufmann Publishers, 1998. 416
23. T. Lukasiewicz. Probabilistic deduction with conditional constraints over basic events. In Principles of Knowledge Representation and Reasoning: Proc. of the 6th International Conference, pages 380-391. Morgan Kaufmann Publishers, 1998. 416
24. T. Lukasiewicz. Probabilistic logic programming. In Proc. of the 13th European Conference on Artificial Intelligence, pages 388-392. J. Wiley & Sons, 1998. 426, 427, 427
25. R. T. Ng. Semantics, consistency, and query processing of empirical deductive databases. IEEE Trans. Knowl. Data Eng., 9(1):32-49, 1997. 426
26. R. T. Ng and V. S. Subrahmanian. Probabilistic logic programming. Inf. Comput., 101:150-201, 1992. 426
27. R. T. Ng and V. S. Subrahmanian. A semantical framework for supporting subjective and conditional probabilities in deductive databases. J. Autom. Reasoning, 10(2):191-235, 1993. 426
28. R. T. Ng and V. S. Subrahmanian. Stable semantics for probabilistic deductive databases. Inf. Comput., 110:42-83, 1994. 426
29. N. J. Nilsson. Probabilistic logic. Artif. Intell., 28:71-88, 1986. 426
30. T. C. Przymusinski. Three-valued nonmonotonic formalisms and semantics of logic programs. Artif. Intell., 49:309-343, 1991. 427
31. N. Rescher. Many-valued Logic. McGraw-Hill, New York, 1969.
32. J. B. Rosser and A. R. Turquette. Many-valued Logics. North-Holland, 1952.
33. V. S. Subrahmanian. Amalgamating knowledge bases. ACM Trans. Database Syst., 19(2):291-331, 1994. 416
34. M. H. van Emden. Quantitative deduction and its fixpoint theory. J. Logic Program., 3(1):37-53, 1986. 424, 427
35. L. A. Zadeh. Fuzzy sets. Information and Control, 8:338-353, 1965. 423