Characterizations of the disjunctive stable semantics by partial evaluation
From MaRDI portal
Publication:4365082
DOI10.1016/S0743-1066(96)00115-XzbMath0883.68082MaRDI QIDQ4365082
Publication date: 26 February 1998
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (20)
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs ⋮ Semantic forgetting in answer set programming ⋮ The infinite-valued semantics: overview, recent results and future directions ⋮ Characterizations of the stable semantics by partial evaluation ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs ⋮ Partial equilibrium logic ⋮ Heterogeneous active agents. III: Polynomially implementable agents ⋮ Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ On the equivalence of the static and disjunctive well-founded semantics and its computation ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Abstraction for non-ground answer set programs ⋮ Well-Founded and Partial Stable Semantics Logical Aspects ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ Relativized hyperequivalence of logic programs for modular programming ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Relating defeasible and normal logic programming through transformation properties.
This page was built for publication: Characterizations of the disjunctive stable semantics by partial evaluation
