Abstract
ACTILOG is a language to write generalized condition → action activation rules. We propose it as an alternative and a complement to OPENLOG [6], another agent logic programming language for an abductive reasoner. We want to show how implications (conditional goals) can be used to state integrity contraints for an agent. These integrity contraints describe conditions under which the agent’s goals must be reduced to plans that can be executed. For instance, a rule such as if A then B, will indicate to the agent that whenever it can prove that A is the case, it then should pursue goal B. B is normally the description of a task that must be reduced to a set of low-level, primitive actions that the agent can execute.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
James F. Allen, Temporal reasoning and planning, Reasoning About Plans (J. F. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, eds.), Morgan Kauffmann Publishers, Inc., San Mateo, California, 1991, ISBN 1-55860-137-6.
Rodney Brooks, Intelligence without representation, Artificial Intelligence (1991), 139–159.
Lee Brownston, Programming expert systems in ops5, Addison-Wesley Inc., USA, 1985.
Jacinto Dávila,Agents in logic programming, Ph.D. thesis, Imperial College, London, UK, 1997.
Jacinto Dávila and Mayerlin Uzcátegui, Galatea: A multi-agent simulation platform, The best of AMSE (C. Berger-Vachon and A.M. Gil lafuente, eds.), http://www.amse-modelling.org/Periodical AMSE.html, AMSE, Barcelona, Spain, 2000.
Jacinto A. Dávila, Openlog: A logic programming language based on abduction, Lecture Notes in Computer Science (Proceedings of PPDP’99. París,France) Gopalan, Nadathur (Ed.). Springer. ISBN 3-540-66540-4. 1702 (1999).
M. Denecker and D. De Schreye, Sldnfa: an abductive procedure for normal abductive programs, Proc. International Conference and Symposium on Logic Programming (1992), 686–700.
Jürgen Dix, Sarit Kraus, and V.S Subrahmanian, Temporal agent programs, Artificial Intelligence (2001), no. 127, 87–135.
T.H Fung and R. Kowalski, The iff proofp rocedure for abductive logic programming, Journal of Logic Programming (1997).
A. C. Kakas, R. Kowalski, and F. Toni, Handbook oflo gic in arti.cial intelligence and logic programming 5, ch. The Role of Abduction in Logic Programming, pp. 235–324, Oxford University Press, 1998.
R Kowalski and F. Sadri, From logic programming towards multi-agent systems, Annals of Mathematics and Artificial Intelligence 25 (1999), 391–419.
Robert Kowalski and Marek Sergot, A logic-based calculus ofevents, New Generation Computing 4 (1986), 67–95.
H. Levesque, R. Reiter, Y. Lespérance, L. Fangzhen, and R. B. Scherl, Golog: A logic programming language for dynamic domains, (1995), (Also at http://www.cs.toronto.edu/~cogrobo/).
J. McCarthy and P. Hayes, Some philosophical problems from the standpoint of artificial intelligence, Machine Intelligence 4 (1969), 463–502.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dávila, J.A. (2003). ACTILOG: An Agent Activation Language. In: Dahl, V., Wadler, P. (eds) Practical Aspects of Declarative Languages. PADL 2003. Lecture Notes in Computer Science, vol 2562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36388-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-36388-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00389-2
Online ISBN: 978-3-540-36388-0
eBook Packages: Springer Book Archive