Skip to main content

The semantics of non-monotonic entailment defined using partial interpretations

  • Preference-Based Model Theory
  • Conference paper
  • First Online:
Non-Monotonic Reasoning (NMR 1988)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 346))

Included in the following conference series:

Abstract

The logic of preferential entailment is generalized to the case where the preference ordering is a part of the models, so that axioms can make statements about the preference ordering, and thereby constrain it. The following technique is used: An aggregate is a pair 〈Δ, ≪〉, where Δ is a set of partial interpretations, and ≪ is a preference order on the members of Δ. A monadic propositional operator D (for default) is introduced, where is satisfied in a member J of Δ in an aggregate 〈Δ, ≪〉 iff α is satisfied in all ≪-minimal completions of J in Δ. A number of examples of the use of this semantics are discussed, and it is shown that default rules can be expressed in such ways that the conclusions dictated by common sense are obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dov Gabbay. Theoretical foundations for non-monotonic reasoning in expert systems. In K.R. Apt, editor, Logics and Models of Concurrent Systems. Springer Verlag, 1985.

    Google Scholar 

  2. Matthew L. Ginsberg. Multi-valued logics. In Proc. Fifth AAAI, pages 243–247, 1986.

    Google Scholar 

  3. S. Kleene. Introduction to Metamathematics. Van Nostrand, 1952.

    Google Scholar 

  4. D. Makinson. General theory of cumulative inference. In Michael Reinfrank, editor, Non-Monotonic Reasoning and Reason Maintenance. Springer, 1988.

    Google Scholar 

  5. Erik Sandewall. An approach to the frame problem, and its implementation. In Machine Intelligence, Vol. 7. Edinburgh University Press, 1972.

    Google Scholar 

  6. Erik Sandewall. An approach to non-monotonic entailment. In Z.W. Ras and L. Saitta, editors, Methodologies for Intelligent Systems, II, pages 391–397. North-Holland, 1988.

    Google Scholar 

  7. Erik Sandewall. Non-monotonic entailment for temporal reasoning, part i. Technical report, Department of Computer and Information Science, Linkoeping University, 1988.

    Google Scholar 

  8. Yoav Shoham. Non-monotonic logics: Meaning and utility. In Proc. Tenth IJCAI, pages 388–393, 1987.

    Google Scholar 

  9. Yoav Shoham. Reasoning about Change. MIT Press, 1988.

    Google Scholar 

  10. R. Thomason and J. Horty. Logics for inheritance theory. In Michael Reinfrank, editor, Non-Monotonic Reasoning and Reason Maintenance. Springer, 1988.

    Google Scholar 

  11. Raymond Turner. Logics for Artificial Intelligence. Ellis Horwood, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. Reinfrank J. de Kleer M. L. Ginsberg E. Sandewall

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sandewall, E. (1988). The semantics of non-monotonic entailment defined using partial interpretations. In: Reinfrank, M., de Kleer, J., Ginsberg, M.L., Sandewall, E. (eds) Non-Monotonic Reasoning. NMR 1988. Lecture Notes in Computer Science, vol 346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50701-9_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-50701-9_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50701-7

  • Online ISBN: 978-3-540-46073-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics