Pages that link to "Item:Q4365082"
From MaRDI portal
The following pages link to Characterizations of the disjunctive stable semantics by partial evaluation (Q4365082):
Displayed 15 items.
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Equivalence for the \(G_3^\prime\)-stable models semantics (Q975880) (← links)
- Hyperequivalence of logic programs with respect to supported models (Q1028652) (← links)
- Relating defeasible and normal logic programming through transformation properties. (Q1853599) (← links)
- Heterogeneous active agents. III: Polynomially implementable agents (Q1978315) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Partial equilibrium logic (Q2457796) (← links)
- Semantics for Possibilistic Disjunctive Programs (Q2845121) (← links)
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
- Well-Founded and Partial Stable Semantics Logical Aspects (Q3392936) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- Relativized hyperequivalence of logic programs for modular programming (Q3648358) (← links)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731) (← links)
- A general theory of confluent rewriting systems for logic programming and its applications (Q5935989) (← links)
- On the equivalence of the static and disjunctive well-founded semantics and its computation (Q5941206) (← links)