×

Reasoning about truth. (English) Zbl 0694.03021

The Perlis construction is described and it is argued that it has certain inadequacies. Therefore another approach to the problem of reasoning about truth is offered, and it is explained why this approach is more preferable. The approach draws on fairly recent work in paraconsistent logic.
Reviewer: Yu.G.Ventsov

MSC:

03B60 Other nonclassical logic
68T99 Artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Asher, N.; Kamp, J., The knower’s paradox and representational theories of attitudes, (Halpern, J. Y., Theoretical Aspects of Reasoning about Knowledge (1986), Morgan Kaufmann: Morgan Kaufmann Los Altos, CA)
[2] Belnap, N., A useful four-valued logic, (Dunn, J. M.; Epstein, G., Modern Uses of Multiple-Valued Logic (1987), Reidel: Reidel Dordrecht) · Zbl 0417.03009
[3] Bollen, A., A relevant extension of PROLOG, (Research Paper and Implementation, Automated Reasoning Project (1988), Australian National University: Australian National University Canberra)
[4] Brady, R., The non-triviality of dialectical set theory, (Priest, G.; Routley, R.; Norman, J., Paraconsistent Logics (1988), Philosophia Verlag) · Zbl 0691.03037
[5] Dowden, B., Accepting inconsistencies from the paradoxes, J. Philos. Logic, 13, 125-130 (1984) · Zbl 0543.03005
[6] Doyle, J., A truth maintenance system, Artificial Intelligence, 12, 231-272 (1979)
[7] Dunn, J. M., Relevance logic and entailment, (Gabbay, D.; Gruender, F., Handbook of Philosophical Logic, 3 (1985), Reidel: Reidel Dordrecht) · Zbl 0875.03051
[8] Fagin, R.; Halpern, J., Belief, awareness and limited reasoning: Preliminary report, (Proceedings IJCAI-85. Proceedings IJCAI-85, Los Angeles, CA (1985)) · Zbl 0634.03013
[9] Halpern, J. Y., (Theoretical Aspects of Reasoning about Knowledge (1986), Morgan Kaufman: Morgan Kaufman Los Altos, CA)
[10] Levesque, H., A logic of implicit and explicit belief, (Proceedings AAAI-84. Proceedings AAAI-84, Austin, TX (1984))
[11] Lin, F., Tableau systems for some paraconsistent logics (to appear); Lin, F., Tableau systems for some paraconsistent logics (to appear)
[12] Perlis, D., Languages with self-reference I: Foundations, Artificial Intelligence, 25, 301-322 (1985) · Zbl 0581.03005
[13] Perlis, D., Languages with self-reference II: Knowledge, belief and modality, Artificial Intelligence, 34, 179-212 (1988) · Zbl 0642.03017
[14] Prawitz, D., (Proof Theory (1965), Almqvist and Wiksell)
[15] Priest, G., Logic of paradox, J. Philos. Logic, 8, 219-241 (1979) · Zbl 0402.03012
[16] Priest, G., Sense, entailment and modus ponens, J. Philos. Logic, 9, 415-435 (1980) · Zbl 0436.03008
[17] Priest, G., Semantic closure, Stud. Logica, 43, 117-129 (1984) · Zbl 0575.03002
[18] Priest, G., (In Contradiction (1987), Nijhoff: Nijhoff Boston, MA)
[19] Priest, G., Consistency by default, (Tech. Rept. TR-ARP-3/88, Automated Reasoning Project (1988), Australian National University: Australian National University Canberra)
[20] Priest, G.; Routley, R., Introduction: Paraconsistent logics, Stud. Logica, 43, 3-16 (1984) · Zbl 0575.03017
[21] (Priest, G.; Routley, R.; Norman, J., Paraconsistent Logics (1988), Philosophia Verlag)
[22] Routley, R., (Relevant Logics and Their Rivals (1982), Ridgeview)
[23] Thistlewaite, P.; McRobbie, M.; Meyer, R., The KRIPKE automated theorem proving system, (Proceedings Eighth International Conference on Automated Deduction (1986)) · Zbl 0612.03011
[24] Thistlewaite, P.; McRobbie, M.; Meyer, R., (Automated Theorem-Proving in Non-Classical Logics (1987), Wiley: Wiley New York)
[25] Thomason, R., Paradoxes and semantic representation, (Halpern, J. Y., Theoretical Aspects of Reasoning about Knowledge (1986), Morgan Kaufmann: Morgan Kaufmann Los Altos, CA)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.