AQL : A query language for action domains modelled using answer set programming
Hopton, L., Cliffe, O., De Vos, M. and Padget, J., 2009. AQL : A query language for action domains modelled using answer set programming. In: Erdem, E., Fangzhen, L. and Schaub, T., eds. Logic Programming and Nonmonotonic Reasoning. Vol. 5753. Berlin, Germany: Springer, pp. 437-443. (Lecture Notes in Computer Science)
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
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 oil 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 oil ASP. Through the synthesis of features it offers a more flexible, versatile and intuitive approach compared to existing languages. Due to the use of ASR AQL call also be used to reason about partial histories.
|Item Type||Book Sections|
|Creators||Hopton, L., Cliffe, O., De Vos, M. and Padget, J.|
|Editors||Erdem, E., Fangzhen, L. and Schaub, T.|
|Departments||Faculty of Science > Computer Science|
Actions (login required)