Characterizations of the disjunctive stable semantics by partial evaluation
From MaRDI portal
Recommendations
Cited in
(23)- Relativized hyperequivalence of logic programs for modular programming
- The infinite-valued semantics: overview, recent results and future directions
- Some (in)translatability results for normal logic programs and propositional theories
- Equivalence for the G₃^-stable models semantics
- On the equivalence between abstract dialectical frameworks and logic programs
- scientific article; zbMATH DE number 7692241 (Why is no real title available?)
- On the equivalence of the static and disjunctive well-founded semantics and its computation
- Abstraction for non-ground answer set programs
- Characterizations of the stable semantics by partial evaluation
- Relating defeasible and normal logic programming through transformation properties.
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
- scientific article; zbMATH DE number 5039823 (Why is no real title available?)
- Omission-based abstraction for answer set programs
- Partial equilibrium logic
- A general theory of confluent rewriting systems for logic programming and its applications
- Hyperequivalence of logic programs with respect to supported models
- Well-Founded and Partial Stable Semantics Logical Aspects
- On dynamics in structured argumentation formalisms
- Semantic forgetting in answer set programming
- Heterogeneous active agents. III: Polynomially implementable agents
- Semantics for possibilistic disjunctive programs
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)
