AQL : A query language for action domains modelled using answer set programming

L Hopton, O Cliffe, M De Vos, J Padget

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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 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.
Original languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning
EditorsE Erdem, L Fangzhen, T Schaub
Place of PublicationBerlin, Germany
PublisherSpringer
Pages437-443
Number of pages7
Volume5753
ISBN (Print)978-3-642-04237-9
DOIs
Publication statusPublished - 2009
Event10th International Conference on Logic Programming and Nonmonotonic Reasoning - Potsdam, Germany
Duration: 14 Sep 200918 Sep 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Conference

Conference10th International Conference on Logic Programming and Nonmonotonic Reasoning
Abbreviated titleLPNMR (2009)
CountryGermany
CityPotsdam
Period14/09/0918/09/09

Fingerprint

Query languages
Semantics
Specifications
Processing
Oils

Cite this

Hopton, L., Cliffe, O., De Vos, M., & Padget, J. (2009). AQL : A query language for action domains modelled using answer set programming. In E. Erdem, L. Fangzhen, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning (Vol. 5753, pp. 437-443). (Lecture Notes in Computer Science). Berlin, Germany: Springer. https://doi.org/10.1007/978-3-642-04238-6_39

AQL : A query language for action domains modelled using answer set programming. / Hopton, L; Cliffe, O; De Vos, M; Padget, J.

Logic Programming and Nonmonotonic Reasoning. ed. / E Erdem; L Fangzhen; T Schaub. Vol. 5753 Berlin, Germany : Springer, 2009. p. 437-443 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hopton, L, Cliffe, O, De Vos, M & Padget, J 2009, AQL : A query language for action domains modelled using answer set programming. in E Erdem, L Fangzhen & T Schaub (eds), Logic Programming and Nonmonotonic Reasoning. vol. 5753, Lecture Notes in Computer Science, Springer, Berlin, Germany, pp. 437-443, 10th International Conference on Logic Programming and Nonmonotonic Reasoning, Potsdam, Germany, 14/09/09. https://doi.org/10.1007/978-3-642-04238-6_39
Hopton L, Cliffe O, De Vos M, Padget J. AQL : A query language for action domains modelled using answer set programming. In Erdem E, Fangzhen L, Schaub T, editors, Logic Programming and Nonmonotonic Reasoning. Vol. 5753. Berlin, Germany: Springer. 2009. p. 437-443. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-04238-6_39
Hopton, L ; Cliffe, O ; De Vos, M ; Padget, J. / AQL : A query language for action domains modelled using answer set programming. Logic Programming and Nonmonotonic Reasoning. editor / E Erdem ; L Fangzhen ; T Schaub. Vol. 5753 Berlin, Germany : Springer, 2009. pp. 437-443 (Lecture Notes in Computer Science).
@inproceedings{8a34bd9407454ce8b1425eacde023aaf,
title = "AQL : A query language for action domains modelled using answer set programming",
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 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.",
author = "L Hopton and O Cliffe and {De Vos}, M and J Padget",
year = "2009",
doi = "10.1007/978-3-642-04238-6_39",
language = "English",
isbn = "978-3-642-04237-9",
volume = "5753",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "437--443",
editor = "E Erdem and L Fangzhen and T Schaub",
booktitle = "Logic Programming and Nonmonotonic Reasoning",

}

TY - GEN

T1 - AQL : A query language for action domains modelled using answer set programming

AU - Hopton, L

AU - Cliffe, O

AU - De Vos, M

AU - Padget, J

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://dx.doi.org/10.1007/978-3-642-04238-6_39

U2 - 10.1007/978-3-642-04238-6_39

DO - 10.1007/978-3-642-04238-6_39

M3 - Conference contribution

SN - 978-3-642-04237-9

VL - 5753

T3 - Lecture Notes in Computer Science

SP - 437

EP - 443

BT - Logic Programming and Nonmonotonic Reasoning

A2 - Erdem, E

A2 - Fangzhen, L

A2 - Schaub, T

PB - Springer

CY - Berlin, Germany

ER -