Skip to main content

Open Default Theories over Closed Domains

(Extended Abstract)

  • Conference paper
  • First Online:
  • 370 Accesses

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

Abstract

We compare two approaches to the meaning of a free variable x in an open default \( \frac{{\alpha (x):M\beta _1 (x),...,M\beta _m (x)}} {{\gamma (x)}} \) . The first treats x as a metavariable for the ground terms of the underlying theory, whereas the second threats it as a “name” of arbitrary elements of the theory universe. We show that, for normal default theories, under the domain closure assumption, the two approaches are equivalent. In the general case, the approaches are equivalent in the presence of both the domain closure assumption and the unique name assumption.

In fact, Poole in [11] considers only normal defaults without prerequisites, i.e., defaults of the form \( \frac{{:M\beta (x)}} {{\beta (x)}} \) .

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader and B. Hollunder, Embedding Defaults into Terminological Knowledge Representation Formalisms, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR’ 92), B. Nebel, C. Rich, and W. Swartout, eds., Morgan Kaufmann, San Mateo, CA, 1992, pp. 306–317.

    Google Scholar 

  2. H.A. Blair and V.W. Marek, Henkin algebras with application to default logic, preprint, the Seventh International Workshop on Nonmonotonic Reasoning, Trento, Italy, 1998.

    Google Scholar 

  3. M. Gelfond and H. Przymusinska, Reasoning in open domains, in Proceedings of the 2nd workshop on Logic Programming and Non-monotonic Reasoning, L.M. Pereira and A. Nerode eds., the MIT Press, Cambridge, MA, 1993, pp. 397–413.

    Google Scholar 

  4. R. Guerreiro and M. Casanova, An alternative semantics for default logic, preprint, the Third International Workshop on Nonmonotonic Reasoning, South Lake Tahoe, 1990.

    Google Scholar 

  5. M. Kaminski, A Comparative Study of Open Default Theories, Artificial Intelligence 77 (1995), 285–319.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Kaminski, J.A. Makowsky, and M. Tiomkin, Extensions for open default theories via the domain closure assumption, Journal of Logic and Computation 8 (1998), 169–187.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Kaminski A note on the stable model semantics for logic programs, Artificial Intelligence 96 (1997), 467–479.

    Article  MATH  MathSciNet  Google Scholar 

  8. K. Konolige, Quantification in autoepistemic logic, Fundamenta Informaticae XV (1991), 275–300.

    MathSciNet  Google Scholar 

  9. V. Lifschitz, On open defaults, in Computational Logic: Symposium Proceedings, J.W. Lloyd, ed., Springer-Verlag, Berlin, 1990, pp. 80–95.

    Google Scholar 

  10. J.W. Lloyd, Foundations of Logic Programming, Second Extended Edition, Springer-Verlag, Berlin, 1993.

    Google Scholar 

  11. D. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1988), 27–47.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980), 81–132.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaminski, M. (1999). Open Default Theories over Closed Domains. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-48747-6_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66131-3

  • Online ISBN: 978-3-540-48747-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics