## Abstract

Recently, Ferraris, Lee and Lifschitz presented a generalized definition of a stable model that applies to the syntax of arbitrary first-order sentences, under which a logic program is viewed as a special class of first-order sentences. The new definition of a stable model is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, we show the opposite direction, that is, how to embed circumscription into the new stable model semantics, and based on this, how to turn some versions of the classical logic event calculus into the general language of stable models. By turning the latter to answer set programs under certain conditions, we show that answer set solvers can be used for classical logic event calculus reasoning, allowing more expressive query answering than what can be handled by the current SAT-based implementations of the event calculus. We prove the correctness of our translation method and compare our work with the related work by Mueller.

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

Pages | 119-133 |

Number of pages | 15 |

State | Published - Jan 1 2008 |

Event | 1st Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2008, collocated with the 24th International Conference on Logic Programming, ICLP 2008 - Udine, Italy Duration: Dec 13 2008 → … |

### Conference

Conference | 1st Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2008, collocated with the 24th International Conference on Logic Programming, ICLP 2008 |
---|---|

Country | Italy |

City | Udine |

Period | 12/13/08 → … |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics
- Hardware and Architecture
- Software
- Artificial Intelligence