Partial Logics with Two Kinds of Negation as a Foundation for Knowledge-Based Reasoning

  • Heinrich Herre
  • Jan Jaspars
  • Gerd Wagner
Part of the Applied Logic Series book series (APLS, volume 13)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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.Google Scholar
  2. [2]
    J. F. A. K. van Benthem. A Manual of Intensional Logic. Vol. 1 of CSLI Lecture Notes. CSLI publications, Stanford, CA, 1984.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    J. Dietrich and H. Herre. Outline of nonmonotonic model theory. Technical Report NTZ-5:94, Universitaet Leipzig Institut fuer Informatik, 1994.Google Scholar
  5. [5]
    J. Dietrich. Deductive basis of nonmonotonic inference operations. Technical Report NTZ-7,94, Universitaet Leipzig Institut fuer Informatik, Leipzig, 1994.Google Scholar
  6. [6]
    S. Feferman. Towards useful type free theories. Journal of Symbolic Logic, 49, 75–111, 1984.CrossRefGoogle Scholar
  7. [7]
    M. Freund and D. Lehmann. Nonmonotonic inference operations: from finitary relations to infinitary operations. Studia Logica, 53, 161–201, 1994.CrossRefGoogle Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the International Conference on Logic Programming. MIT Press, 1990.Google Scholar
  12. [12]
    H. Herre. Generalized compactness of nonmonotonic inference operations. Journal ofAppl. Non-Classical Logics, 5, 21–135, 1995.Google Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    J. O. M. Jaspars. Partial up and down logic. Notre Dame Journal of Formal Logic, 36, 134–157, 1995.CrossRefGoogle Scholar
  15. [15]
    S. Koerner. Experience and Theory. Kegan Paul, London, 1966.Google Scholar
  16. [16]
    T. Langholm. Partiality, Truth and Persistence. Vol. 15 of CSLI Lecture Notes. CSLI publications, Stanford, CA, 1988.Google Scholar
  17. [17]
    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.Google Scholar
  18. [18]
    D. Makinson. General patterns in nonmonotonic reasoning. In Handbook of Logic in Artificial Intelligence and Logic Programming. D. Gabbay, ed. Oxford University Press, 1993.Google Scholar
  19. [19]
    R. A. Muskens. Meaning and Partiality. Vol No.2 of Studies in Logic, Language and Information. CSLI Publications, Stanford (CA ), 1995. To appear.Google Scholar
  20. [20]
    G. Priest. Reasoning about truth. Artificial Intelligence, 39, 231–244, 1989.CrossRefGoogle Scholar
  21. [21]
    M. Papalaskari and S. Weinstein. Minimal consequence in sentential logic. Journal of Logic Programming, 9, 19–31, 1990.CrossRefGoogle Scholar
  22. [22]
    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.Google Scholar
  23. [23]
    E. G. C. Thijsse. Partial Logic and Knowledge Representation. PhD thesis, University of Tilburg, Tilburg, July 1992.Google Scholar
  24. [24]
    R. H. Thomason. A semantical study of constructible falsity. Zeitschrift für Mathematischen Logik and Grundlagen der Mathematik, 15, 247–257, 1969.CrossRefGoogle Scholar
  25. [25]
    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.Google Scholar
  26. [26]
    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.Google Scholar
  27. [27]
    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.Google Scholar
  28. [28]
    G. Wagner. Vivid Logic — Knowledge-Based Reasoning with Two Kinds of Negation. Vol. 764 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 1994.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1999

Authors and Affiliations

  • Heinrich Herre
    • 1
  • Jan Jaspars
    • 2
  • Gerd Wagner
    • 1
  1. 1.Univ. LeipzigGermany
  2. 2.Centrum v. Wiskunde en InformaticaThe Netherlands

Personalised recommendations