Abstract
As opposed to theoretical reasoning, such as in mathematics, where all predicates are exact,1 and a single contradiction destroys the entire theory, knowledge-based reasoning has to be able to deal with inexact predicates (e.g. from empirical domains) having truth value gaps, and with knowledge bases containing contradictory items but being still informative. Therefore, partial logics allowing both for truth-value gaps and for inconsistency are natural candidates for modelling knowledgebased reasoning.
This is a preview of subscription content, log in via an institution to check access.
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. Aczel. Saturated intuitionistic theories. In Contributions to Mathematical Logic, H. Schmidt, K. Schütte and H. Thiele, eds. pp. 1–13. North Holland, Amsterdam, 1968.
J. F. A. K. van Benthem. A Manual of Intensional Logic. Vol. 1 of CSLI Lecture Notes. CSLI publications, Stanford, CA, 1984.
S. Blarney. Partial logic. In Handbook of Philosophical Logic, Vol 111: Alternatives to Classical Logic, D. M. Gabbay and F. Guenthner, eds. pp. 1–70. Reidel, Dordrecht, 1986.
J. Dietrich and H. Herre. Outline of nonmonotonic model theory. Technical Report NTZ-5:94, Universitaet Leipzig Institut fuer Informatik, 1994.
J. Dietrich. Deductive basis of nonmonotonic inference operations. Technical Report NTZ-7,94, Universitaet Leipzig Institut fuer Informatik, Leipzig, 1994.
S. Feferman. Towards useful type free theories. Journal of Symbolic Logic, 49, 75–111, 1984.
M. Freund and D. Lehmann. Nonmonotonic inference operations: from finitary relations to infinitary operations. Studia Logica, 53, 161–201, 1994.
J. E. Fenstad, T. Langholm and E. Vespren. Representations and interpretations. In Computational Linguistics and Formal Semantics, Studies in Natural Language Processing, M. Rosner and R. Johnson, eds. pp. 31–95. Cambridge University Press, Cambridge, 1992.
P. C. Gilmore. The consistency of partial set theory without extensionality. In Proceedings of Symposia in Pure Mathematics, Vol. 13 Part II. American Mathematical Society, Providence (RI), 1974.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of ICLP, R. A. Kowalski and K. A. Bowen, eds. pp. 1070–1080. MIT Press, 1988.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the International Conference on Logic Programming. MIT Press, 1990.
H. Herre. Generalized compactness of nonmonotonic inference operations. Journal ofAppl. Non-Classical Logics, 5, 21–135, 1995.
J. O. M. Jaspars. Calculi for Constructive Communication: A Study of the Dynamics of Partial States. PhD thesis, University of Tilburg, Amsterdam—Tilburg, June 1994. ILLC dissertation series 1994–4, and also ITK dissertation series 1994–1.
J. O. M. Jaspars. Partial up and down logic. Notre Dame Journal of Formal Logic, 36, 134–157, 1995.
S. Koerner. Experience and Theory. Kegan Paul, London, 1966.
T. Langholm. Partiality, Truth and Persistence. Vol. 15 of CSLI Lecture Notes. CSLI publications, Stanford, CA, 1988.
T. Langholm. What is a horn clause in partial logic? In Logics in AI (JELIA’90). Vol. 478 of Lecture Notes in Artificial Intelligence, J. van Eijck, ed. pp. 65–77, Heidelberg, 1991. Springer-Verlag.
D. Makinson. General patterns in nonmonotonic reasoning. In Handbook of Logic in Artificial Intelligence and Logic Programming. D. Gabbay, ed. Oxford University Press, 1993.
R. A. Muskens. Meaning and Partiality. Vol No.2 of Studies in Logic, Language and Information. CSLI Publications, Stanford (CA ), 1995. To appear.
G. Priest. Reasoning about truth. Artificial Intelligence, 39, 231–244, 1989.
M. Papalaskari and S. Weinstein. Minimal consequence in sentential logic. Journal of Logic Programming, 9, 19–31, 1990.
G. Gottlob T. Eiter and Y. Gurevich. Curbe your theory! A circumscriptive approach for inclusive interpretation of dijunctive information. In Proceedings of International Joint Conference on Artificial Intelligence, 1993.
E. G. C. Thijsse. Partial Logic and Knowledge Representation. PhD thesis, University of Tilburg, Tilburg, July 1992.
R. H. Thomason. A semantical study of constructible falsity. Zeitschrift für Mathematischen Logik and Grundlagen der Mathematik, 15, 247–257, 1969.
A. van Gelder. Negation as failure using tight derivations for general logic programs. In Foundations of Deductive Databases and Logic Programming, pp. 149–176. Morgan Kaufmann, San Mateo, CA, 1988.
G. Wagner. A database needs two kinds of negation. In Proceedings of the 3rd. Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Lecture Notes in Computer Science, B. Thalheim and H.-D. Gerhardt, eds. pp. 357–371. Springer-Verlag, 1991.
G. Wagner. Transforming deductive into active databases. In Proceedings of the 10th Workshop on Logic Programming. N. Fuchs and G. Gottlob, eds. Univ. Zürich, 1994.
G. Wagner. Vivid Logic — Knowledge-Based Reasoning with Two Kinds of Negation. Vol. 764 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Herre, H., Jaspars, J., Wagner, G. (1999). Partial Logics with Two Kinds of Negation as a Foundation for Knowledge-Based Reasoning. In: Gabbay, D.M., Wansing, H. (eds) What is Negation?. Applied Logic Series, vol 13. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9309-0_7
Download citation
DOI: https://doi.org/10.1007/978-94-015-9309-0_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5169-1
Online ISBN: 978-94-015-9309-0
eBook Packages: Springer Book Archive