Advertisement

Representation theory for default logic

  • V. Wiktor Marek
  • Jan Treur
  • Mirosław Truszczyński
Article

Abstract

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of extensions of a default theory. We give a complete solution to the problem of representability by means of default theories with finite set of defaults, and by means of normal default theories. We obtain partial results on representability by arbitrary (infinite, non-normal) default theories. We construct examples of denumerable families of non-including theories that are not representable. We also study the concept of equivalence between default theories.

Keywords

Representation Theory Propositional Atom Countable Family Default Theory Default Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P.A. Bonatti and T. Eiter, Querying disjunctive databases through nonmonotonic logics, in: Proceedings of the 5th International Conference on Database Theory — ICDT 95, Lecture Notes in Computer Science 893 (Springer, Berlin, 1995).Google Scholar
  2. [2]
    P. Besnard, An Introduction to Default Logic (Springer, Berlin, 1989).Google Scholar
  3. [3]
    G. Brewka, Nonmonotonic Reasoning: Logical Foundations of Commonsense (Cambridge Univ. Press, Cambridge, UK, 1991).Google Scholar
  4. [4]
    P. Cholewiński, W. Marek, A. Mikitiuk and M. Truszczyński, Experimenting with nonmonotonic reasoning, in: Proceedings of the 12th International Conference on Logic Programming (MIT Press Cambridge, MA, 1995).Google Scholar
  5. [5]
    D.W. Etherington, Reasoning with Incomplete Information (Pitman, London, 1988).Google Scholar
  6. [6]
    A. Ferry, Topological characterizations for logic programming semantics, Doctoral dissertation, University of Michigan (1994).Google Scholar
  7. [7]
    V. Lifschitz, Circumscriptive theories: a logic-based framework for knowledge representation, Journal of Philosophical Logic 17 (1988) 391–441.MathSciNetCrossRefGoogle Scholar
  8. [8]
    J. McCarthy, Circumscription — a form of non-monotonic reasoning, Artificial Intelligence 13 (1980) 27–39.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [9]
    W. Marek and M. Truszczyński, Nonmonotonic Logics; Context-Dependent Reasoning (Springer, Berlin, 1993).Google Scholar
  10. [10]
    R. Reiter, On closed world data bases, in: Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum Press, 1978) pp. 55–76.Google Scholar
  11. [11]
    R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81–132.zbMATHMathSciNetCrossRefGoogle Scholar
  12. [12]
    T. Schaub, On constrained default theories, in: Proceedings of the 11th European Conference on Artificial Intelligence, ECAI 92 (Wiley, 1992) pp. 304–308.Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • V. Wiktor Marek
    • 1
  • Jan Treur
    • 2
  • Mirosław Truszczyński
    • 3
  1. 1.Department of Computer ScienceUniversity of KentuckyLexingtonUSA
  2. 2.Department of Mathematics and Computer Science, Artificial Intelligence Group, De Boelelaan 1081aFree University AmsterdamAmsterdamThe Netherlands
  3. 3.Department of Computer ScienceUniversity of KentuckyLexingtonUSA

Personalised recommendations