Indeed: Interactive Deduction on Horn Clause Theories | SpringerLink
Skip to main content
Springer Nature Link
Log in

Indeed: Interactive Deduction on Horn Clause Theories

  • Conference paper
  • First Online:
Advances in Artificial Intelligence — IBERAMIA 2002 (IBERAMIA 2002)

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

Included in the following conference series:

  • 888 Accesses

Abstract

We introduce the declarative programming language Indeed that uses both deduction and interaction through multi-agent system applications. The language design is addressed by providing a uniform programming model that combines two refinements of resolution along with some control strategies to introduce state-based descriptions. We show that the logical calculus in which the computational model is based is sound and complete. Finally, we compare our approach to others proposed for coupling interaction with automated deduction.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Belmesk, Z. Habbas and P. Jorrand A Process Algebra over the Herbrand Universe: Application to Parallelism in Automated Deduction. In B. Fronhofer and G. Wrighston. Parallelization of inference Systems. LNAI 590. Springer-Verlag. 1990.

    Google Scholar 

  2. N. Carriero and D. Gelernter, Linda in Context, CACM, 32(4):444–458, Apr 1989.

    Google Scholar 

  3. P. Ciancarini Coordinating Rule-Based Software Processes with ESP, ACM Trans. on Software Engineering and Methodology, 2(3):203–227, July, 1993.

    Article  MathSciNet  Google Scholar 

  4. M. J. C. Gordon and T. F. Melham, Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, 1993.

    Google Scholar 

  5. A. C. Kakas, R. A. Kowalski and F. Toni, The role of abduction in logic programming. Handbook of Logic in AI and Logic Programming, 5:235–324, Oxford University Press, 1998.

    MathSciNet  Google Scholar 

  6. J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, 1987.

    Google Scholar 

  7. T. Nipkow, Isabelle HOL: The Tutorial, http://www.in.tum.de/~nipkow/, 1998

  8. V. A. Saraswat Concurrent Constraint Programming. Records of 17thA CM Symposium on Principles of Programming Languages, 232–245. San Franciso, CA. 1990.

    Google Scholar 

  9. F. Sadri and F. Toni, Abduction with Negation as Failure for Active Databases and Agents. E. Lamma and P. Mello eds., Springer Verlag LNAI, 1792:49–60, 2000.

    Google Scholar 

  10. S. Tahar and P. Curzon, Comparing HOL and MDG: A Case Study on the Verification of an ATM Switch Fabric. Nordic Journal of Computing, 6(4):372–402, Winter 1999.

    MATH  Google Scholar 

  11. R. D. Tennet, Semantics of Programming Languages, Prentice Hall Intl., 1991.

    Google Scholar 

  12. P. Wegner, Interactive Software Technology, CRC Handbook of Computer Science and Engineering, May 1996.

    Google Scholar 

  13. L. Wos, R. Overbeek, E. Lusk and J. Boyle, Automated Reasoning. Introduction and Applications, McGraw-Hill, Inc., 1992.

    Google Scholar 

  14. L. Wos and G. Pieper, A Fascinating Country in the World of Computing: Your Guide to Automated Reasoning, World Scientific Publishing Co., 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Section, CINVESTAV-IPN, Av. I. P. N. 2508, 07300, Mexico City, Mexico

    Oscar Olmedo-Aguirre & Guillermo Morales-Luna

Authors
  1. Oscar Olmedo-Aguirre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guillermo Morales-Luna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Telefónica Investigación y Desarrollo, Emilio Vargas 6, 28043, Madrid, Spain

    Francisco J. Garijo

  2. Dpto. Lenguajes y Sistemas Informáticos, Universidad de Sevilla, ETS Ingeniería Informática, 41012, Seville, Spain

    José C. Riquelme  & Miguel Toro  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olmedo-Aguirre, O., Morales-Luna, G. (2002). Indeed: Interactive Deduction on Horn Clause Theories. In: Garijo, F.J., Riquelme, J.C., Toro, M. (eds) Advances in Artificial Intelligence — IBERAMIA 2002. IBERAMIA 2002. Lecture Notes in Computer Science(), vol 2527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36131-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-36131-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation