Skip to main content
SpringerLink
Log in
Book cover

International Conference on Flexible Query Answering Systems

FQAS 2004: Flexible Query Answering Systems pp 459–472Cite as

Consequence Finding in Default Theories

  • Conference paper

  • 291 Accesses

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

Abstract

Consequence finding has been recognized as an important technique in many intelligent systems involving inference. In previous work, propositional or first-order clausal theories have been considered for consequence finding. In this paper, we consider consequence finding within a default theory, which consists of a first-order clausal theory and a set of normal defaults. In each extension of a default theory, consequence finding can be performed with the ”generating defaults” for the extension. Alternatively, we consider all extensions in one theory with the ”conditional consequence” format, which explicitly represents how a conclusion depends on which defaults. We also propose a procedure to compute consequences from a default theory based on a first-order consequence-finding procedure SOL. The SOL calculus is then further refined using skip-preference and complement checking, which have a great ability of preventing irrational derivations. The proposed system can be well applied to a multi-agent system with speculative computation in an incomplete communication environment.

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

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. de Giacomo, G.: Intensional query answering by partial evaluation. Journal of Intelligent Information Systems 7(3), 205–233 (1996)

    Article  Google Scholar 

  2. del Val, A.: A new method for consequence finding and compilation in restricted languages. In: Proceedings of AAAI 1999, pp. 259–264 (1999)

    Google Scholar 

  3. Demolombe, R.: A strategy for the computation of conditional answers. In: Proceedings of ECAI 1992. LNCS (LNAI), vol. 810, pp. 134–138. Springer, Heidelberg (1992)

    Google Scholar 

  4. Demolombe, R.: Answers about validity and completeness of data: formal definitions, usefulness and computation technique. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 138–147. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Demolombe, R., del Cerro, L.F.: An inference rule for hypothesis generation. In: Proceedings of IJCAI 1991, pp. 152–157. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  6. Green, C.: Theorem-proving by resolution as a basis for question-answering systems. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 4, pp. 183–205. Edinburgh University Press (1969)

    Google Scholar 

  7. Imielinski, T.: Intelligent query answering in rule based systems. Journal of Logic Programming 4, 229–257 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence 56, 301–353 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  9. Inoue, K.: Induction, abduction, and consequence-finding. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 65–79. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Inoue, K.: AAutomated abductionutomated abduction. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 311–341. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Inoue, K., Iwanuma, K.: Speculative computation through consequence-finding in multi-agent environments. Annals of Mathematics and Artificial Intelligence (2004) (to appear)

    Google Scholar 

  12. Iwanuma, K., Inoue, K.: Minimal answer computation and SOL. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 245–257. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Iwanuma, K., Inoue, K., Satoh, K.: Completeness of pruning methods for consequence finding procedure SOL. In: Proceedings of the 3rd International Workshop on First-Order Theorem Proving, pp. 89–100 (2000)

    Google Scholar 

  14. Kunen, K.: The semantics of answer literals. Journal of Automated Reasoning 17, 83–95 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lee, C.T.: A completeness theorem and computer program for finding theorems derivable from given axioms. Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA (1967)

    Google Scholar 

  16. Letz, R.: Clausal tableaux. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction: A Basis for Applications, vol. 1, pp. 39–68. Kluwer, Dordrecht (1998)

    Google Scholar 

  17. Linke, T., Schaub, T.: Alternative foundations for Reiter’s default logic. Artificial Intelligence 124, 31–86 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Marquis, P.: Consequence finding algorithms. In: Gabbay, D.M., Smets, P. (eds.) Handbook for Defeasible Reasoning and Uncertain Management Systems, vol. 5, pp. 41–145. Kluwer, Dordrecht (2000)

    Google Scholar 

  19. McIlaith, S., Amir, E.: Theorem proving with structured theories. In: Proceedings of IJCAI 2001, pp. 624–631. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  20. Nabeshima, H., Iwanuma, K., Inoue, K.: SOLAR: a consequence finding system for advanced reasoning. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 257–263. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. Poole, D., Goebel, R., Aleliunas, R.: Theorist: a logical reasoning system for defaults and diagnosis. In: Cercone, N., McCalla, G. (eds.) The Knowledge Frontier: Essays in the Representation of Knowledge,

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  24. Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32, 571–595 (1987)

    Article  MathSciNet  Google Scholar 

  25. Reiter, R., de Kleer, J.: Foundations of assumption-based truth maintenance systems: preliminary report. In: Proceedings of AAAI 1987, pp. 183–187. Morgan Kaufmann, San Francisco (1987)

    Google Scholar 

  26. Satoh, K., Inoue, K., Iwanuma, K., Sakama, C.: Speculative computation by abduction under incomplete communication environments. In: Proceedings of the Fourth International Conference on MultiAgent Systems, pp. 263–270 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan

    Katsumi Inoue

  2. Department of Computer and Media Engineering, Yamanashi University, 4-3-11 Takeda, Kofu, 400-8511, Japan

    Koji Iwanuma & Hidetomo Nabeshima

Authors
  1. Katsumi Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koji Iwanuma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hidetomo Nabeshima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research group PLIS: Programming, Logic and Intelligent Systems, Department of Communication, Business and Information Technologies, Roskilde University, P.O. Box 260, DK-4000, Roskilde, Denmark

    Henning Christiansen

  2. LIRIS - UFR d’Informatique, Université Claude Bernard Lyon 1, 43, boulevard du 11 novembre 1918,, 69622, Villeurbanne, France

    Mohand-Saïd Hacid

  3. Department of Computer Science, Roskilde University, P.O. Box 260, DK-4000, Roskilde, Denmark

    Troels Andreasen

  4. Department of Computer Science and Engineering, Aalborg University Esbjerg, Niels Bohrs Vej 8Niels Bohrs Vej 8, 6700, Esbjerg, Denmark

    Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inoue, K., Iwanuma, K., Nabeshima, H. (2004). Consequence Finding in Default Theories. In: Christiansen, H., Hacid, MS., Andreasen, T., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2004. Lecture Notes in Computer Science(), vol 3055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25957-2_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25957-2_36

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation