Action Languages(ID:6852/act028)

A set of six languages - three action languages A, B, and C and three action query languages P, Q, and R
Related languages
Prolog => Action Languages   Extension of
References:
  • Gelfond, Michael, and Lifschitz, Vladimir. 1990. Logic programs with classical negation. In Warren, D., and Szeredi, P., eds., Logic Programming: Proceedings of the Seventh International Conf., pp579?597 view details
  • Gelfond, M. and Lifschitz, V. 1993. Representing Actions and Change by Logic Programs, In J. of Logic Programming 17, 301?323, 1993. view details
  • Lifschitz, V. "Two components of an action language" in Common Sense 96, 1996 view details Abstract: Some of the recent work on representing action makes use of high-level action languages. In this paper we show that an action language can be represented as the sum of two distinct parts: an "action description language" and an "action query language." A set of propositions in an action description language describes the effects of actions on states. Mathematically, it defines a transition system of the kind familiar from the theory of finite automata. An action query language serves for expressing properties of paths in a given transition system. We define the general concepts of a transition system, of an action description language and of an action query language, give a series of examples of languages of both kinds, and show how to combine a description language and a query language into one. This construction makes it possible to design the two components of an action language independently, which leads to the simplification and clarification of the theory of actions.
    External link: Online copy
  • Hidetomo Nabeshima, Katsumi Inoue "Automata Theory for Action Language A" IPSJ JOURNAL 38(03) view details Abstract: We formally investigate the expressive power of the high-level action language A(Gelfond and Lifschitz,1993).As the result,the class of domains represented in A and the class for languages accepted by finite automata(FA)are proved to be equivalent.To show the equivalence,we present two algorithms: 1)an algorithm to translate any domain description in A into finite automata,2)an algorithm to translate any finite automaton into propositions in A.The former algorithm computes models of a description in A.The latter algorithm has the function to simplify of any domain description in A.The advantages of the equivalence between A and FA are as follows: a)Planning problems can be concisely characterized by regular expressions.b)Theories of reasoning about action can be applied to various domains in computer science.c)We have a better perspective on extensions of action languages from the formal language theory.

  • Enrico Giunchiglia, Vladimir Lifschitz "An action language based on causal explanation: preliminary report" Proceedings of the fifteenth national/tenth conference on Artificial intelligence Innovative applications of artificial intelligence pp623-630 1998 view details
  • Gelfond, M. and Lifschitz, V. "Action languages" Electronic Transactions on Artificial Intelligence 3(6) view details Abstract: Action languages are formal models of parts of the natural language that are used for talking about the effects of actions. This article is a collection of definitions related to action languages that may be useful as a reference in future publications.
  • Balduccini, M.; Gelfond, M.; Nogueira, M. "A-Prolog as a tool for declarative programming" view details
          in Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE'2000) view details
  • Balduccini, M. ; M.Gelfond, M.Nogueira, R.Watson,M.Barry: An A-Prolog decision support system. for the space shuttle , AAAI Spring 2001 Symposium, Mar 2001 view details
          in Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE'2000) view details
  • Gelfond, M. ; M. Balduccini, J. Galloway: Diagnosing physical systems in A-Prolog , Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 213-225, Sep 2001 view details
          in Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE'2000) view details
  • Gelfond, M. Representing Knowledge in A-Prolog (pdf version) , volume 2408 of Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, pages 413-451, 2002 view details
          in Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE'2000) view details
  • Balduccini, M. and M. Gelfond: Diagnostic Reasoning with A-Prolog (pdf version) , Theory and Practice of Logic Programming, 3(4-5):425-461, Jul 2003 view details
          in Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE'2000) view details