Pages that link to "Item:Q5431419"
From MaRDI portal
The following pages link to Propositional theories are strongly equivalent to logic programs (Q5431419):
Displayed 29 items.
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Cut-free formulations for a quantified logic of here and there (Q638492) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version (Q2133436) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Forgetting auxiliary atoms in forks (Q2321342) (← links)
- Infinitary equilibrium logic and strongly equivalent logic programs (Q2407875) (← links)
- Capturing equilibrium models in modal logic (Q2447178) (← links)
- Syntactic ASP forgetting with forks (Q2694542) (← links)
- Temporal Here and There (Q2835864) (← links)
- Forgetting in ASP: The Forgotten Properties (Q2835900) (← links)
- Here and There among Logics for Logic Programming (Q2900511) (← links)
- The rise and fall of semantic rule updates based on<tt>SE</tt>-models (Q2933088) (← links)
- The Modal Logic of Equilibrium Models (Q3172888) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- Stable Models for Temporal Theories (Q3449185) (← links)
- Infinitary Equilibrium Logic and Strong Equivalence (Q3449222) (← links)
- Rule Calculus: Semantics, Axioms and Applications (Q3532483) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- Temporal equilibrium logic: a survey (Q4583305) (← links)
- Model-based recasting in answer-set programming (Q4583308) (← links)
- A denotational semantics for equilibrium logic (Q4593002) (← links)
- Characterization of logic program revision as an extension of propositional revision (Q4593020) (← links)
- Merging Logic Programs under Answer Set Semantics (Q4649730) (← links)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731) (← links)
- A Syntactic Operator for Forgetting that Satisfies Strong Persistence (Q5108521) (← links)
- Explaining Preferences and Preferring Explanations (Q5172617) (← links)
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There (Q5504650) (← links)
- Syntactic ASP forgetting with forks (Q6152659) (← links)