Propositional theories are strongly equivalent to logic programs

DOI10.1017/S1471068407003110zbMath1132.68321MaRDI QIDQ5431419

Pedro Cabalar, Paolo Ferraris

Publication date: 10 December 2007

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

equilibrium logiclogic of here-and-thereanswer setsstrong equivalence

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (29)

Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version ⋮ Stable Models for Temporal Theories ⋮ Infinitary Equilibrium Logic and Strong Equivalence ⋮ Here and There among Logics for Logic Programming ⋮ The Modal Logic of Equilibrium Models ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ The rise and fall of semantic rule updates based onSE-models ⋮ Infinitary equilibrium logic and strongly equivalent logic programs ⋮ Temporal equilibrium logic: a survey ⋮ Model-based recasting in answer-set programming ⋮ A denotational semantics for equilibrium logic ⋮ Characterization of logic program revision as an extension of propositional revision ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Syntactic ASP forgetting with forks ⋮ Cut-free formulations for a quantified logic of here and there ⋮ On the limits of forgetting in answer set programming ⋮ Rule Calculus: Semantics, Axioms and Applications ⋮ Capturing equilibrium models in modal logic ⋮ Merging Logic Programs under Answer Set Semantics ⋮ Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs ⋮ Explaining Preferences and Preferring Explanations ⋮ Syntactic ASP forgetting with forks ⋮ On syntactic forgetting under uniform equivalence ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ Temporal Here and There ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Forgetting auxiliary atoms in forks ⋮ Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

This page was built for publication: Propositional theories are strongly equivalent to logic programs