Classical logic event calculus as answer set programming

Joohyung Lee, Ravi Palla

Research output: Contribution to conferencePaper

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 languageEnglish (US)
Pages119-133
Number of pages15
StatePublished - Jan 1 2008
Event1st 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

Conference1st Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2008, collocated with the 24th International Conference on Logic Programming, ICLP 2008
CountryItaly
CityUdine
Period12/13/08 → …

Fingerprint

Event Calculus
Answer Set Programming
Stable Models
Classical Logic
Answer Sets
First-order
Logic Programs
Correctness
Reasoning
Semantics
Query
Arbitrary

ASJC Scopus subject areas

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

Cite this

Lee, J., & Palla, R. (2008). Classical logic event calculus as answer set programming. 119-133. Paper presented at 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.

Classical logic event calculus as answer set programming. / Lee, Joohyung; Palla, Ravi.

2008. 119-133 Paper presented at 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.

Research output: Contribution to conferencePaper

Lee, J & Palla, R 2008, 'Classical logic event calculus as answer set programming' Paper presented at 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, 12/13/08, pp. 119-133.
Lee J, Palla R. Classical logic event calculus as answer set programming. 2008. Paper presented at 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.
Lee, Joohyung ; Palla, Ravi. / Classical logic event calculus as answer set programming. Paper presented at 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.15 p.
@conference{b01e8310e6824ae08bdda1bb4aaab510,
title = "Classical logic event calculus as answer set programming",
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.",
author = "Joohyung Lee and Ravi Palla",
year = "2008",
month = "1",
day = "1",
language = "English (US)",
pages = "119--133",
note = "1st Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2008, collocated with the 24th International Conference on Logic Programming, ICLP 2008 ; Conference date: 13-12-2008",

}

TY - CONF

T1 - Classical logic event calculus as answer set programming

AU - Lee, Joohyung

AU - Palla, Ravi

PY - 2008/1/1

Y1 - 2008/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=85072320734&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072320734&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85072320734

SP - 119

EP - 133

ER -