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)
68Q55: Semantics in the theory of computing
Related Items
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, On the equivalence of the static and disjunctive well-founded semantics and its computation, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Equivalence for the \(G_3^\prime\)-stable models semantics, Hyperequivalence of logic programs with respect to supported models, Relating defeasible and normal logic programming through transformation properties., Heterogeneous active agents. III: Polynomially implementable agents, Semantic forgetting in answer set programming, Partial equilibrium logic, Semantics for Possibilistic Disjunctive Programs, Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs, Well-Founded and Partial Stable Semantics Logical Aspects, Some (in)translatability results for normal logic programs and propositional theories, Relativized hyperequivalence of logic programs for modular programming
