### Abstract

Action language C+, a formalism based on nonmonotonic causal logic, was designed for describing properties of actions. The definite fragment of C+ was implemented in system the Causal Calculator (CCalc), based on a reduction of nonmonotonic causal logic to propositional logic. On the other hand, in this paper, we represent the language of CCalc in answer set programming (ASP), by translating nonmonotonic causal logic into formulas under the stable model semantics. We design a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input programs in the language of ASP. Using the combination of system f2lp and answer set solvers, our prototype implementation of this approach, which we call Cplus2ASP, achieves functionality close to CCalc while taking advantage of answer set solvers to yield efficient computation that is orders of magnitude faster than CCalc on several benchmark examples.

Original language | English (US) |
---|---|

Title of host publication | Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011 |

Pages | 51-61 |

Number of pages | 11 |

State | Published - Dec 1 2011 |

Event | 27th International Conference on Logic Programming, ICLP 2011 - Lexington, KY, United States Duration: Jul 6 2011 → Jul 10 2011 |

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 11 |

ISSN (Print) | 1868-8969 |

### Other

Other | 27th International Conference on Logic Programming, ICLP 2011 |
---|---|

Country | United States |

City | Lexington, KY |

Period | 7/6/11 → 7/10/11 |

### Keywords

- Action languages
- Answer set programming
- Nonmonotonic causal logic

### ASJC Scopus subject areas

- Software

## Fingerprint Dive into the research topics of 'Representing the language of the causal calculator in answer set programming'. Together they form a unique fingerprint.

## Cite this

*Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011*(pp. 51-61). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 11).