Pages that link to "Item:Q5738917"
From MaRDI portal
The following pages link to Strongly equivalent logic programs (Q5738917):
Displayed 40 items.
- Ordering default theories and nonmonotonic logic programs (Q557790) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- A first order nonmonotonic extension of constructive logic (Q813086) (← links)
- Equivalence issues in abduction and induction (Q833733) (← links)
- Strong order equivalence (Q854968) (← links)
- Equilibrium logic (Q854969) (← links)
- Conceptual logic programs (Q854977) (← links)
- Skepticism relations for comparing argumentation semantics (Q962903) (← links)
- Equivalence for the \(G_3^\prime\)-stable models semantics (Q975880) (← links)
- General default logic (Q987485) (← links)
- Strong equivalence of logic programs under the infinite-valued semantics (Q987828) (← links)
- Default logic generalized and simplified (Q1028638) (← links)
- Hyperequivalence of logic programs with respect to supported models (Q1028652) (← links)
- Safe beliefs for propositional theories (Q1779312) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Solving logic program conflict through strong and weak forgettings (Q2457621) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Partial equilibrium logic (Q2457796) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- Well-Founded and Partial Stable Semantics Logical Aspects (Q3392936) (← links)
- Strongly Equivalent Temporal Logic Programs (Q3532454) (← links)
- Rule Calculus: Semantics, Axioms and Applications (Q3532483) (← links)
- Towards closed world reasoning in dynamic open worlds (Q3585167) (← links)
- A program-level approach to revising logic programs under the answer set semantics (Q3585168) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- Probabilistic reasoning with answer sets (Q3612603) (← links)
- Formal Properties of Modularisation (Q3631354) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- Relativized hyperequivalence of logic programs for modular programming (Q3648358) (← links)
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets (Q5445291) (← links)
- Twelve Definitions of a Stable Model (Q5504644) (← links)
- Quo Vadis Answer Set Programming? (Q5504648) (← links)
- Quantified Equilibrium Logic and Foundations for Answer Set Programs (Q5504679) (← links)
- Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (Q5504680) (← links)
- Relativized Hyperequivalence of Logic Programs for Modular Programming (Q5504681) (← links)
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case (Q5504682) (← links)