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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
N. Carriero and D. Gelernter, Linda in Context, CACM, 32(4):444–458, Apr 1989.
P. Ciancarini Coordinating Rule-Based Software Processes with ESP, ACM Trans. on Software Engineering and Methodology, 2(3):203–227, July, 1993.
M. J. C. Gordon and T. F. Melham, Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, 1993.
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.
J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, 1987.
T. Nipkow, Isabelle HOL: The Tutorial, http://www.in.tum.de/~nipkow/, 1998
V. A. Saraswat Concurrent Constraint Programming. Records of 17thA CM Symposium on Principles of Programming Languages, 232–245. San Franciso, CA. 1990.
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.
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.
R. D. Tennet, Semantics of Programming Languages, Prentice Hall Intl., 1991.
P. Wegner, Interactive Software Technology, CRC Handbook of Computer Science and Engineering, May 1996.
L. Wos, R. Overbeek, E. Lusk and J. Boyle, Automated Reasoning. Introduction and Applications, McGraw-Hill, Inc., 1992.
L. Wos and G. Pieper, A Fascinating Country in the World of Computing: Your Guide to Automated Reasoning, World Scientific Publishing Co., 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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