TY - GEN
T1 - Action language BC+
T2 - 7th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2014 - Affiliated with the International Conference on Logic Programming, ICLP 2010, part of the Federated Logic Conference 2014
AU - Babb, Joseph
AU - Lee, Joohyung
N1 - Funding Information:
Acknowledgements We are grateful to the anonymous referees for their useful comments. This work was partially supported by the National Science Foundation under Grant IIS-1319794 and by the South Korea IT R&D program MKE/KIAT 2010-TD-300404-001.
PY - 2014
Y1 - 2014
N2 - Recently, action language BC, which combines the attractive features of action languages B and C+, was proposed. While BC allows Prolog-style recursive definitions that are not available in C+, it is less expressive than C+ in other ways, such as inability to express non-Boolean and non-exogenous actions. We propose a new action language called BC+, which encompasses all the features of BC and the definite fragment of C+. The syntax of BC+ is identical to the syntax of C+ allowing arbitrary propositional formulas in the causal laws, but its semantics is defined in terms of propositional formulas under the stable model semantics instead of nonmonotonic causal theories. This approach allows many useful ASP constructs, such as choice rules and aggregates, to be directly used in language BC+, and exploits computational methods available in ASP solvers.
AB - Recently, action language BC, which combines the attractive features of action languages B and C+, was proposed. While BC allows Prolog-style recursive definitions that are not available in C+, it is less expressive than C+ in other ways, such as inability to express non-Boolean and non-exogenous actions. We propose a new action language called BC+, which encompasses all the features of BC and the definite fragment of C+. The syntax of BC+ is identical to the syntax of C+ allowing arbitrary propositional formulas in the causal laws, but its semantics is defined in terms of propositional formulas under the stable model semantics instead of nonmonotonic causal theories. This approach allows many useful ASP constructs, such as choice rules and aggregates, to be directly used in language BC+, and exploits computational methods available in ASP solvers.
UR - http://www.scopus.com/inward/record.url?scp=85085673479&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85085673479&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85085673479
T3 - Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2014
BT - Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2014
PB - Computing Research Repository (CoRR)
Y2 - 23 July 2014
ER -