Abstract
In this paper we present a new version of action language H which is more expressive and powerful than its previous version. We enhanced the syntax to include triggers which allows us to reason about natural actions. The new version is capable of modeling a variety of domains, demonstrating that it is a good language for knowledge representation. We present the syntax and semantics of the language and show how it can be used to model the behavior of a bouncing ball.
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
Balduccini, M.: Representing constraint satisfaction problems in answer set programming. In: ICLP 2009 Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009) (July 2009)
Baral, C., Gelfond, M.: Reasoning agents in dynamic domains. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 257–279. Kluwer Academic Publishers (2000)
Baral, C., Son, T., Tuan, L.: A transition function based characterization of actions with delayed and continuous effects. In: Proc. of KR 2002, pp. 291–302 (2002)
Chintabathina, S., Gelfond, M., Watson, R.: Modeling hybrid domains using process description language. In: Proc. of ASP 2005, pp. 303–317 (2005)
Chintabathina, S.: Towards Answer Set Progamming Based Architectures for Intelligent Agents. PhD Dissertation. Texas Tech University (December 2010)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proc. of ICLP 1988, pp. 1070–1080. The MIT Press, Cambridge (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–386 (1991)
Gelfond, M., Lifschitz, V.: Representing action and change by logic programs. Journal of Logic Programming 17, 301–321 (1993)
Gelfond, M., Lifschitz, V.: Action languages. Electronic Transactions on AI 3(16) (1998)
McCain, N., Turner, H.: A causal theory of ramifications and qualifications. In: Mellish, C. (ed.) Proc. of IJCAI 1995, pp. 1978–1984. Morgan Kaufmann (1995)
McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4, 463–502 (1969)
Mellarkod, V.: Integrating ASP and CLP Systems: Computing Answer Sets from Partially Ground Programs. Texas Tech University (2007)
Mellarkod, V., Gelfond, M., Zhang, Y.: Integrating Answer Set Programming and Constraint Logic Programming. In: Proc. of ISAIM 2008 (2008), http://isaim2008.unl.edu/index.php
Mellarkod, V.: Optimizing The Computation Of Stable Models Using Merged Rules. Masters Thesis. Texas Tech University (May 2002)
Ricardo Morales, A.: Improving Efficiency of Solving Computational Problems with ASP. PhD Dissertation. Texas Tech University (December 2010)
Reiter, R.: Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press (2001)
Shanahan, M.: Solving the frame problem. MIT Press (1997)
Shanahan, M.: The event calculus explained. In: Artificial Intelligence Today, pp. 409–430 (1999)
Turner, H.: Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming 31(1-3), 245–298 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chintabathina, S., Watson, R. (2012). A New Incarnation of Action Language H. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-30743-0_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30742-3
Online ISBN: 978-3-642-30743-0
eBook Packages: Computer ScienceComputer Science (R0)