{"type":"ScholarlyArticle","title":"The Implications of Paraconsistency","authors":[{"name":"John K. Slaney","slug":"john-k-slaney","given":"John K.","family":"Slaney","affiliation":"Automated Reasoning Project Australian National University GPO Box 4 , Canberra , ACT 2601 Australia"}],"abstract":"This is a connected series of arguments concerning paraconsistent logic. It is argued first that paraconsistency is an option worth pursuing in automated reasoning, then that the most popular paraconsistent logic, fde, is inadequate for the reconstruction of essential first order arguments. After a case is made for regarding quantifiers as dyadic rather than monadic operators, it is shown that the addition of such quantifiers to fde allows an implication connective to be defined yielding the known logic BN4. Refining the tr e atment of implication in a manner similar to that found in intuitionist logic leads to the more interesting system BN.","doi":null,"url":"https://ijcai.org/proceedings/1991/155","pdf":"https://ijcai.org/proceedings/1991/0155.pdf","markdown":"https://ijcai.org/proceedings/1991/155.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/155","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Philosophical Foundations","track":"Philosophical Foundations","number":155,"pages":{"first":1052,"last":1058},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Belnap, 1973] Nuel D. Belnap. Restricted Quantifica- tion and Conditional Assertion. In H. Leblanc, editor, Truth, Syntax and Modality, pages xx-xx.","title":"Restricted Quantification and Conditional Assertion","authors":"D Nuel, Belnap","year":null,"venue":"Truth, Syntax and Modality","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Amster- dam, 1973.","title":null,"authors":"Amsterdam","year":"1973","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Belnap, 1977] Nuel D. Belnap. A Useful Four-Valued Logic. In J.M. Dunn & G. Epstein, editors, Mod- ern Uses of Multiple-Valued Logics, pages 8-37.","title":"A Useful Four-Valued Logic","authors":"D Nuel, Belnap","year":null,"venue":"Modern Uses of Multiple-Valued Logics","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Dor- drecht, 1977.","title":null,"authors":"Dordrecht","year":"1977","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dunn, 1976a] J. Michael Dunn. Intuitive Semantics for First-Degree Entailments and \"Coupled Trees\". Philo- sophical Studies, 29:149-168, 1976.","title":"Intuitive Semantics for First-Degree Entailments and \"Coupled Trees","authors":"] J Dunn ; A, Michael Dunn","year":"1976","venue":"Philosophical Studies","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dunn, 1976b] J. Michael Dunn . A Kripke-Style Seman- tics for R-Mingle Using a Binary Accessibility Rela- tion. Studia Logica, 35:163-172, 1976.","title":"A Kripke-Style Semantics for R-Mingle Using a Binary Accessibility Relation","authors":"] J Dunn ; B, Michael Dunn","year":"1976","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Levesque, 1984] Hector J. Levesque. A Fundamental Tradeoff in Knowledge Representation and Reasoning. FLAIR Technical Report 35, Fairchild Laboratory for AI Research, Ontario, 1984.","title":"A Fundamental Tradeoff in Knowledge Representation and Reasoning","authors":"Hector J Levesque","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"R.A. Girle has produced tableau-based theorem provers for BN and some related systems. These are a good start, but clearly must be taken much further and applied to some realistic examples. The Automated Reasoning group in Can- berra intends to produce workable software embodying some of the above ideas. [Meyer et a/., 1984]","title":"Girle has produced tableau-based theorem provers for BN and some related systems","authors":"R A","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"Robert K. Meyer, S. Giambrone & Ross T. Brady. Where Gamma Fails. Studia Logica, 43:247-256, 1984.","title":"Where Gamma Fails","authors":"Robert K Meyer, S Giambrone, Ross T Brady","year":"1984","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Patel-Schneider, 1991] Peter F . Patel-Schneider. A De- cidable First-Order Logic for Knowledge Representa- tion . Journal of Automated Reasoning, forthcoming.","title":"A Decidable First-Order Logic for Knowledge Representation","authors":"F Peter, Patel-Schneider","year":null,"venue":"Journal of Automated Reasoning","doi":null,"url":null,"internal_url":"/proceedings/1985/89"},{"position":11,"raw":"[Priest, 1980] Graham G. Priest. Sense, Truth and Modus Ponens. Journal of Philosophical Logic, 9:415- 435, 1980.","title":"Sense, Truth and Modus Ponens","authors":"G Graham, Priest","year":"1980","venue":"Journal of Philosophical Logic","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Slaney et a/., 1989] John Slaney, Timothy Surendonk & Roderic Girle. Time, Truth and Logic. Technical Re- port TR-ARP-11/89, Automated Reasoning Project, Australian National University, Canberra, 1989.","title":"Time, Truth and Logic","authors":"John Slaney, Timothy Surendonk, Roderic Girle","year":"1989","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Urbas, 1990] Igor F . Urbas. Paraconsistency. Studies in Soviet Thought, 39:343-354, 1990.","title":"Paraconsistency","authors":"Igor F Urbas","year":"1990","venue":"Studies in Soviet Thought","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}