Modeling paraconsistent reasoning by classical logic

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

Volumn 2284, Issue , 2002, Pages 1-14

  Arieli, Ofer ^a   Denecker, Marc ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DATA HANDLING; INFORMATION MANAGEMENT; LOGIC PROGRAMMING;

CLASSICAL LOGIC; CLASSICAL THEORY; INCONSISTENT DATA; KNOWLEDGE SYSTEM; MULTIPLE VALUED LOGIC; PARACONSISTENT REASONING; POLYNOMIAL TRANSFORMATIONS; THEOREM PROVERS;

MANY VALUED LOGICS;

EID: 84956990650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45758-5_1     Document Type: Conference Paper

References (24)

1. O. Arieli, A. Avron. The logical role of the four-valued bilattice. Proc. LICS’98, pp.218–226, IEEE Press, 1998.
2. O. Arieli, A. Avron. The value of the four values. Artificial Intelligence 102(1), pp.97–141, 1998.
3. O. Arieli, A. Avron. Bilattices and paraconsistency. Frontiers of Paraconsistent Logic (D. Batens, C. Mortensen, G. Priest, J. Van Bendegem, editors), pp.11–27, Studies in Logic and Computation 8, Research Studies Press, 2000.
4. O. Arieli, M. Denecker. Circumscriptive approaches to paraconsistent reasoning. Technical Report CW-304, Department of Computer Science, University of Leuven, 2001.
5. N. D. Belnap. A useful four-valued logic. Modern Uses of Multiple-Valued Logic (G.Epstein, J.M.Dunn, editors), pp.7–37, Reidel Publishing Company, 1977.
6. N. D. Belnap. How computer should think. Contemporary Aspects of Philosophy (G.Ryle, editor), pp.30–56, Oriel Press, 1977.
7. N. C. A. da-Costa. On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic 15, pp.497–510, 1974.
8. P. Doherty, W. Lukaszewicz, A. Szalas. Computing circumscription revisited: Preliminary report. Proc. IJCAI’95, pp.1502–1508, 1995.
9. P. Doherty, W. Lukaszewicz, A. Szalas. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning 18, pp.297–334, 1997.
10. M. L. Ginsberg. A circumscriptive theorem prover. Artificial Intelligence 29, pp.209–230, 1989.
11. M. Kifer, E. L. Lozinskii. RI: A logic for reasoning with inconsistency. Proc. LICS’89, pp.253–262, IEEE Press, 1989.
12. M. Kifer, E. L. Lozinskii. A logic for reasoning with inconsistency. Journal of Automated Reasoning 9(2), pp.179–215, 1992.
13. S. Kraus, D. Lehmann, M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1–2) pp.167–207, 1990.
14. D. Lehmann, M. Magidor. What does a conditional knowledge base entail? Artificial Intelligence 55, pp.1–60, 1992.
15. D. Makinson. General theory of cumulative inference. Non-Monotonic Reasoning (M.Reinfrank, editor), LNAI 346, pp.1–18, Springer, 1989.
16. D. Makinson. General patterns in nonmonotonic reasoning. Handbook of Logic in Artificial Intelligence and Logic Programming 3 (D.Gabbay, C.Hogger, J.Robinson, editors) pp.35–110, Oxford Science Pub., 1994.
17. J. McCarthy. Circumscription – A form of non monotonic reasoning. Artificial Intelligence 13(1–2), pp.27–39, 1980.
18. J. McCarthy. Applications of circumscription to formalizing common-Sense knowledge. Artifical Intelligence 28, pp.89–116, 1986.
19. H. J. Ohlbach, SCAN – Elimination of predicate quantifiers. Proc. CADE’96, (M.A.McRobbie, J.Slaney, editors), LNAI 1104, pp.161–165, Springer, 1996.
20. G. Priest. Reasoning about truth. Artificial Intelligence 39, pp.231–244, 1989.
21. G. Priest. Minimally Inconsistent LP. Studia Logica 50, pp.321–331, 1991.
22. T. Przymusinski. An algorithm to compute circumscription. Artificial Intelligence 38, pp.49–73, 1991.
23. Y. Shoham. Reasoning about change. MIT Press, 1988.
24. A. Tarski. Introduction to logic. Oxford University Press, N.Y., 1941.