On the complexity of entailment in propositional multivalued logics

Annals of Mathematics and Artificial Intelligence

Volumn 18, Issue 1, 1996, Pages 29-50

  Cadoli, Marco ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444446907     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02136173     Document Type: Article

References (29)

1. A. Anderson and N. Belnap. Entailment: The Logic of Relevance and Necessity (Princeton University Press, Princeton, NJ, 1975).
2. N. Belnap, A useful four-valued logic, in: Modern Uses of Many-Valued Logics, eds. G. Eppstein and J. Dunn (Reidel, Dordrecht, Netherlands, 1977) pp. 8-37.
3. R. Boppana and M. Sipser, The complexity of finite functions, in: Handbook of Theoretical Computer Science, ed. J. van Leeuwen. Vol. A, Chapter 14 (Elsevier Science Publishers B.V.. North-Holland, 1990).
4. M. Cadoli and M. Schaerf, Approximate inference in default reasoning and circumscription, in: Proceedings of the Tenth European Conference' on Artificial Intelligence (ECAI-92) (August 1992) pp. 319-323.
5. Full version appears in Fundamenta Informaticae 23 (1995) 123-143.
6. M. Cadoli and M. Schaerf, Approximate reasoning and non-omniscient agents, in: Proceedings of the Fourth Conference on Theoretical Aspects of Reasoning about Knowledge (TARK-92) (1992) pp. 169-183.
7. Full version appears in Artificial Intelligence Journal 74 (1995) 249-310.
8. M. Cadoli and M. Schaerf, Approximation in concept description languages, in: Proceedings of the Third International Conference on the Principles of Knowledge Representation and Reasoning (KR-92), eds. B. Nebel, C. Rich and W. Swartout (October 1992) pp. 330-341.
9. S.A. Cook, The complexity of theorem-proving procedures, in: Proceedings of the 3rd ACM Symposium on Theory Of Computing (STOC-71) (1971) pp. 151-158.
10. M. Dalal, Efficient prepositional constraint propagation, in: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92) (1992) pp. 409-414.
11. W.P. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming I (1984) 267-284.
12. R. Fagin, J.Y. Halpern and M.Y. Vardi, A nonstandard approach to the logical omniscience problem, in: Proceedings of the Third Conference on Theoretical Aspects of Reasoning about Knowledge (TARK-90) (1990) pp. 41-55.
13. M. Fitting, A Kripke-Kleene semantics for logic programs, Journal of Logic Programming 2 (1985) 295-312.
14. A.M. Frisch, Using model theory to specify AI programs, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85) (1985) pp. 148-154.
15. A.M. Frisch, Inference without chaining, in: Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87) (1987) pp. 515-519.
16. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, CA, 1979).
17. M.L. Ginsberg, Multivalued logics: A uniform approach to reasoning in artificial intelligence. Computational Intelligence 4 (1988) 265-316.
18. J. Hintikka, Impossible possible worlds vindicated, Journal of Philosophical Logic 4 (1975) 475-484.
19. E. Horowitz and S. Sahni, Fundamentals of Data Structures (Pitman, London, 1976).
20. M. Kifer and E.L. Lozinskii, A logic for reasoning with inconsistency, Journal of Automated Reasoning 9(2) (November 1992) 179-215.
21. G. Lakemeyer, Tractable meta-reasoning in propositional logics of belief, in: Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87) (1987) pp. 402-408.
22. H.J. Levesque, A logic of implicit and explicit belief, in: Proceedings of the Fourth National Conference on Artificial Intelligence (AAAI-84) (1984) pp. 198-202.
23. H.J. Levesque, Logic and the complexity of reasoning, Journal of Philosophical Logic 17 (1988) 355-389.
24. H.J. Levesque, A knowledge-level account of abduction, in: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89) (1989) pp. 1061-1067.
25. P.F. Patel-Schneider, A four-valued semantics for terminological logic, Artificial Intelligence Journal (1989) 319-351.
26. P.F. Patel-Schncider, A decidable first-order logic for knowledge representation, Journal of Automated Reasoning 6 (1990) 361-388.
27. T. Przymusinski, Three-valued formalizations of non-monotonic reasoning and logic programming, in: Proceedings of the First International Conference on the Principles of Knowledge Representation and Reasoning (KR-89) (1989) pp. 341-348.
28. A. van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38 (1991) 620-650.
29. M.Y. Vardi, The complexity of relational query languages, in: Proceedings of the 14th ACM Symposyum on Theory Of Computing (STOC-82) (1982) pp. 137-146.