Skip to main content
SpringerLink
Log in

Extension calculus and query answering in prioritized default logic

  • Conference paper
  • First Online:
Artificial Intelligence: Methodology, Systems, and Applications (AIMSA 1998)

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

Abstract

This paper presents a novel view of default reasoning in presence of priorities which are represented by an arbitrary partial order on default rules. We propose here a new approach for computing extensions from the prioritized default theories initially proposed by Brewka [4]. By this way, we obtain two results, one for extension calculus, and another for query answering. Given a prioritized default theory, in the first case we are able to build more efficiently all its extensions, and in the second case we are able to compute the prioritized default proof of a given formula.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader and B. Hollunder. How to prefer more specific defaults in terminological default logic. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 669–674, 1993.

    Google Scholar 

  2. G. Brewka. Preferred subtheories: An extended logical framework for default reasoning. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1043–1048, 1989.

    Google Scholar 

  3. G. Brewka. Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50(2):183–205, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Brewka. Adding priorities and specificity to default logic. In L. Pereira and D. Pearce, editors, European Workshop on Logics in Artificial Intelligence (JELIA '94), Lecture Notes in Artificial Intelligence, pages 247–260. Springer Verlag, 1994.

    Google Scholar 

  5. J. Delgrande and T. Schaub. A general approach to specificity in default reasoning. In J. Doyle, P. Torasso, and E. Sandewall, editors, Proceedings of the Fourth International Conference on the Principles of Knowledge Representation and Reasoning, pages 146–157. Morgan Kaufmann Publishers, 1994.

    Google Scholar 

  6. W. łukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.

    Google Scholar 

  7. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Reiter and G. Criscuolo. On interacting defaults. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 270–276, 1981.

    Google Scholar 

  9. A. Rothschild and T. Schaub. A computational approach to default logics. In G. Brewka and C. Witteveen, editors, Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications, volume 2, pages 1–14, 1993.

    Google Scholar 

  10. T. Schaub. On constrained default theories. In B. Neumann, editor, Proceedings of the European Conference on Artificial Intelligence, pages 304–308. John Wiley & sons, 1992.

    Google Scholar 

  11. T. Schaub. Computing queries from prioritized default theories. In Z. Ras and M. Zemankova, editors, Eighth International Symposium on Methodologies for Intelligent Systems (ISMIS'94), volume 869 of Lecture Notes in Artificial Intelligence, pages 584–593. Springer Verlag, 1994.

    Google Scholar 

  12. T. Schaub and P. Nicolas. An implementation platform for query-answering in default logics: The xray system, its implementation and evaluation. In J. Dix and U. Furbach, editors, Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence, pages 441–452. Springer Verlag, 1997.

    Google Scholar 

  13. C. Schwind. A tableaux-based theorem prover for a decidable subset of default logic. In M. Stickel, editor, Proceedings of the Conference on Automated Deduction. Springer Verlag, 1990.

    Google Scholar 

  14. C. Schwind and V. Risch. Tableau-based characterization and theorem proving for default logic. Journal of Automated Reasoning, 13:223–242, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Université d'Angers, 2, bd Lavoisier, F-49045, Angers cedex 01

    F. Benhammadi & P. Nicolas

  2. Institut für Informatik, Universität Potsdam, Postfach 60 15 53, D-14415, Potsdam

    T. Schaub

Authors
  1. F. Benhammadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Nicolas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fausto Giunchiglia

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benhammadi, F., Nicolas, P., Schaub, T. (1998). Extension calculus and query answering in prioritized default logic. In: Giunchiglia, F. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 1998. Lecture Notes in Computer Science, vol 1480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057436

Download citation

  • DOI: https://doi.org/10.1007/BFb0057436

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64993-9

  • Online ISBN: 978-3-540-49793-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation