Strong equivalence of nonmonotonic theories-an algebraic approach (abstract)

Miroslaw Truszczyński

Strong equivalence of nonmonotonic theories-an algebraic approach (abstract)

Miroslaw Truszczyński

Computer Science

Producción científica: Paper › revisión exhaustiva

Resumen

We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.

Idioma original	English
Estado	Published - 2006
Evento	9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006 - Fort Lauderdale, FL, United States Duración: ene 4 2006 → ene 6 2006

Conference

Conference	9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006
País/Territorio	United States
Ciudad	Fort Lauderdale, FL
Período	1/4/06 → 1/6/06

ASJC Scopus subject areas

Artificial Intelligence
Applied Mathematics

Otros archivos y enlaces

Citar esto

@conference{2e2e386faa3648e2a033af396e545720,

title = "Strong equivalence of nonmonotonic theories-an algebraic approach (abstract)",

abstract = "We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.",

author = "Miroslaw Truszczy{\'n}ski",

year = "2006",

language = "English",

note = "9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006 ; Conference date: 04-01-2006 Through 06-01-2006",

}

TY - CONF

T1 - Strong equivalence of nonmonotonic theories-an algebraic approach (abstract)

AU - Truszczyński, Miroslaw

PY - 2006

Y1 - 2006

N2 - We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.

AB - We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.

UR - https://www.scopus.com/pages/publications/84864531080

UR - https://www.scopus.com/pages/publications/84864531080#tab=citedBy

M3 - Paper

AN - SCOPUS:84864531080

T2 - 9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006

Y2 - 4 January 2006 through 6 January 2006

ER -

Strong equivalence of nonmonotonic theories-an algebraic approach (abstract)

Resumen

Conference

ASJC Scopus subject areas

Otros archivos y enlaces

Huella

Citar esto