Characterizations of the disjunctive stable semantics by partial evaluation

DOI10.1016/S0743-1066(96)00115-XMaRDI QIDQ4365082zbMATH OpenFDO

Authors J. Dix, Stefan Brass

Publication date 26 February 1998

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(96)00115-X

zbMATH Keywords

disjunctive logic programssemantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Characterizations of the stable semantics by partial evaluation
• scientific article; zbMATH DE number 25192
• Semantics of (disjunctive) logic programs based on partial evaluation

Cited in

(25)

• 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
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• The infinite-valued semantics: overview, recent results and future directions
• Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
• Semantics of (disjunctive) logic programs based on partial evaluation
• Omission-based abstraction for answer set programs
• Characterizations of the stable semantics by partial evaluation
• On the equivalence between abstract dialectical frameworks and logic programs
• scientific article; zbMATH DE number 5039823 (Why is no real title available?)
• Abstraction for non-ground answer set 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
• scientific article; zbMATH DE number 7692241 (Why is no real title available?)
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• On dynamics in structured argumentation formalisms
• Equivalence for the G₃^-stable models semantics

This page was built for publication: Characterizations of the disjunctive stable semantics by partial evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365082)