Abstract
Databases and knowledge bases could be inconsistent in many ways. For example, if a programmer is constructing an expert system ES relating to a domain D,he does so by consulting several experts (say n in number) in the field D. From each expert d i , 1 ≤ i ≤ n, he obtains some information, and this may be represented in logic as a collection of sentences, ES i , for 1 ≤ i ≤ n. The simplest way of combining the resulting knowledge is to set
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Anderson and W. W. Bledsoe (1970): A Linear Format for Resolution with Merging and a New Technique for Establishing Completeness. JACM 17(3), 525–534.
N. D. Belnap (1977): A Useful Four-Valued Logic. In: G. Epstein and J. M. Dunn, eds.: Modern Uses of Many-valued Logic. D. Reidel, 8–37.
H. A. Blair and V. S. Subrahmanian (1987): Paraconsistent Logic Programming. Proc. 7th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science 287, 340–360, Springer Verlag. Extended version in: Theoretical Computer Science 68, 135–154.
H. A. Blair and V. S. Subrahmanian (1988): Paraconsiistent Foundations for Logic Programming. Journal of Non-Classical Logic 5(2), 45–73.
C. L. Chang and R. C. T. Lee (1973): Symbolic Logic and Mechanical Theorem Proving. Academic Press.
P. D. Cheng and J. Y. Juang (1987): A Parallel Resolution Procedure Based on Connection Graph. Proc. Sixth AAAI, 13–17.
N. C. A. da Costa (1974): On the Theory of Inconsistent Formal Systems. Notre Dame J. of Formal Logic 15, 497–510.
N. C. A. da Costa and E. H. Alves (1981): Relations between Paraconsistent Logic and Many-valued Logic. Bulletin of the Section of Logic 10, 185–191.
N. C. A. da Costa, J. J. Lu, V. S. Subrahmanian, and L. J. Henschen (1989): Automatic Theorem Proving in Paraconsistent Logics: Foundations and Experimental Results. Proc. 10th CADE, LNCS, Springer Verlag, 72–86.
N. C. A. da Costa, V. S. Subrahmanian, and C. Vago (1989): The Paraconsistent Logics PT. to appear in: Zeitschrift fur Mathematische Logik and Grundlagen der Mathematik, 37, 1991.
B. A. Davey and H. A. Priestley (1990): Introduction to Lattices and Order. Cambridge University Press.
M. C. Fitting (1989): Bilattices and the Theory of Truth. Journal of Philosophical Logic 18, 225–256.
M. C. Fitting (1988): Logic Programming on a Topological Bilattice. Fundamenta Informatica 11, 209–218.
M. C. Fitting (1988): Bilattices and the Semantics of Logic Programming. To appear in: Journal of Logic Programming.
D. Fishman and J. Minker (1975): 1-Representation: A Clause Representation for Parallel Search. Artificial Intelligence 6, 103–127.
M. Kifer and T. Krishnaprasad (1989): An Evidence Based Framework for a Theory of Inheritance. Proc. 11th International Joint Conf. on Artificial Intelligence, 1093–1098.
M. Kifer and E. Lozinskii (1989): RI: A Logic for Reasoning with Inconsistency. LICS-89.
M. Kifer and J. Wu (1989): A Logic for Object Oriented Logic Programming. Proc. 8th ACM Symp. on Principles of Database Systems, 379–393.
D. W. Loveland (1970): A Linear Format for Resolution. Proc. IRIA Symp. on Automatic Demonstration, Lecture Notes in Mathematics, Springer, 147–162.
D. W. Loveland (1972): A Unifying View of some Linear Herbrand Procedures. JACM 19, 366–384.
J. J. Lu, L. J. Henschen, V. S. Subrahmanian and N. C. A. da Costa (1990): Automated Deduction in Paraconsistent Logics. The full version of this paper. Tech Report, Northwestern University.
J. Roberge (1988): Distributed Resolution-based Theorem Proving Systems. Ph. D. Thesis, Northwestern University.
V. S. Subrahmanian (1987): On the Semantics of Quantitative Logic Programs. Proc. 4th IEEE Symposium on Logic Programming, Computer Society Press, Washington DC, 173–182.
V. S. Subrahmanian (1989): Algebraic Properties of the Space of Multivalued and Paraconsistent Logic Programs. Proc. 9th Intl. Conf. on Foundations of Software Technology and Theoretical Computer Science, LNCS 405, Springer-Verlag, 56–67.
L. Wos, D. Carson, and G. Robinson (1964): The Unit Preference Strategy in Theorem Proving. Proceedings of the AFIPS Conference 26, 615–621.
L. Wos (1988): Automated Reasoning: 33 Research Problems. Prentice Hall.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Lu, J.J., Henschen, L.J., Subrahmanian, V.S., da Costa, N.C.A. (1991). Reasoning in Paraconsistent Logics. In: Boyer, R.S. (eds) Automated Reasoning. Automated Reasoning Series, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3488-0_9
Download citation
DOI: https://doi.org/10.1007/978-94-011-3488-0_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5542-0
Online ISBN: 978-94-011-3488-0
eBook Packages: Springer Book Archive