Mapping Action Language BC to Logic Programs: A Characterization by Postulates

Abstract

We have earlier shown that the standard mappings from action languages B and C to logic programs under answer set semantics can be captured by sets of properties on transition systems. In this paper, we consider action language BC and show that a standard mapping from BC action descriptions to logic programs can be similarly captured when the action rules in the descriptions do not have consistency conditions.

Cite

Text

Zhang and Lin. "Mapping Action Language BC to Logic Programs: A Characterization by Postulates." AAAI Conference on Artificial Intelligence, 2016. doi:10.1609/AAAI.V30I1.10106

Markdown

[Zhang and Lin. "Mapping Action Language BC to Logic Programs: A Characterization by Postulates." AAAI Conference on Artificial Intelligence, 2016.](https://mlanthology.org/aaai/2016/zhang2016aaai-mapping/) doi:10.1609/AAAI.V30I1.10106

BibTeX

@inproceedings{zhang2016aaai-mapping,
  title     = {{Mapping Action Language BC to Logic Programs: A Characterization by Postulates}},
  author    = {Zhang, Haodi and Lin, Fangzhen},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {1116-1123},
  doi       = {10.1609/AAAI.V30I1.10106},
  url       = {https://mlanthology.org/aaai/2016/zhang2016aaai-mapping/}
}