Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Reasoning about action II: the qualification problem
Artificial Intelligence
The anomalous extension problem in default reasoning
Artificial Intelligence
Autoepistemic logic and formalization of commonsense reasoning: preliminary report
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Logic programming
A simple solution to the Yale shooting problem
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Artificial intelligence and mathematical theory of computation
Temporal reasoning in logic programming: a case for the situation calculus
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Formalizing Commonsense: Papers by John McCarthy
Formalizing Commonsense: Papers by John McCarthy
Computing ramifications by postprocessing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Reasoning about actions: non-deterministic effects, constraints, and qualification
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
An action language based on causal explanation: preliminary report
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Reasoning agents in dynamic domains
Logic-based artificial intelligence
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Representing Actions over Dynamic Domains
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Applications of action languages in cognitive robotics
Correct Reasoning
Hi-index | 0.00 |
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.