Propositional theories are strongly equivalent to logic programs
From MaRDI portal
Recommendations
Cited in
(40)- Safe beliefs for propositional theories
- On syntactic forgetting under uniform equivalence
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- On the limits of forgetting in answer set programming
- Forgetting auxiliary atoms in forks
- Infinitary equilibrium logic and strongly equivalent logic programs
- Capturing equilibrium models in modal logic
- Syntactic ASP forgetting with forks
- Temporal here and there
- Forgetting in ASP: the forgotten properties
- Here and there among logics for logic programming
- The rise and fall of semantic rule updates based on SE-models
- The Modal Logic of Equilibrium Models
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Stable Models for Temporal Theories
- Infinitary Equilibrium Logic and Strong Equivalence
- Rule Calculus: Semantics, Axioms and Applications
- Minimal Logic Programs
- Discovering classes of strongly equivalent logic programs
- Some (in)translatability results for normal logic programs and propositional theories
- Synonymous theories and knowledge representations in answer set programming
- 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
- Merging Logic Programs under Answer Set Semantics
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
- A syntactic operator for forgetting that satisfies strong persistence
- Non-constructive procedural theory of propositional problems and the equivalence of solutions
- Explaining preferences and preferring explanations
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
- Syntactic ASP forgetting with forks
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Cut-free formulations for a quantified logic of here and there
- On Heuer's procedure for verifying strong equivalence
- Logic programming
- A brief history of updates of answer-set programs
- Forgetting in answer set programming -- a survey
- Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
- Strong equivalence of logic programs under the infinite-valued semantics
This page was built for publication: Propositional theories are strongly equivalent to logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431419)
