A generalization of the Lin-Zhao theorem

DOI10.1007/s10472-006-9025-2zbMath1105.68015OpenAlexW2144198727MaRDI QIDQ854963

Vladimir Lifschitz, Paolo Ferraris, Joohyung Lee

Publication date: 20 December 2006

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-006-9025-2

zbMATH Keywords

nonmonotonic reasoninglogic programminganswer set programmingstable modelsloop formulasClark's completion

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items

Stable Models for Temporal Theories ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Temporal equilibrium logic: a survey ⋮ Relating Two Dialects of Answer Set Programming ⋮ Syntactic ASP forgetting with forks ⋮ A general first-order solution to the ramification problem with cycles ⋮ Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets ⋮ Syntactic ASP forgetting with forks ⋮ Temporal Logic Modeling of Biological Systems ⋮ Metabolic Pathways as Temporal Logic Programs ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP

Uses Software

• ASSAT
• Cmodels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• ASSAT: computing answer sets of a logic program by SAT solvers
• Circumscription - a form of non-monotonic reasoning
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Nested expressions in logic programs
• The well-founded semantics for general logic programs
• Tight logic programs
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: A generalization of the Lin-Zhao theorem