AQL: A Query Language for Action Domains Modelled Using Answer Set Programming

Authors:
Luke Hopton;Owen Cliffe;Marina Vos;Julian Padget
Affiliations:
Department of Computer Science, University of Bath, BATH, UK BA2 7AY;Department of Computer Science, University of Bath, BATH, UK BA2 7AY;Department of Computer Science, University of Bath, BATH, UK BA2 7AY;Department of Computer Science, University of Bath, BATH, UK BA2 7AY
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 4
Cited 3

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
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
The DLVK Planning System: Progress Report

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Nonmonotonic causal theories

Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning

InstQL: a query language for virtual institutions using answer set programming

CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Query-driven coordination of multiple answer sets

DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Applications of action languages in cognitive robotics

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new general purpose query and abduction language for reasoning about action domains that allows the processing of simultaneous actions, definition of conditions and reasoning about fluents and actions. AQL provides a simple declarative syntax for the specification of constraints on the histories (the combination of action traces and state transitions) within the modelled domain. Its semantics, provided by the translation of AQL queries into Ans-Prolog , acquires the benefits of the reasoning power provided by Answer Set Programming (ASP). The answer sets obtained from combining the query and the domain description correspond to those histories of the domain changing over time that satisfy the query. The result is a simple, high-level query and constraint language that builds on ASP. Through the synthesis of features it offers a more flexible, versatile and intuitive approach compared to existing languages. Due to the use of ASP, AQL can also be used to reason about partial histories.