Strongly equivalent logic programs
From MaRDI portal
Publication:5738917
DOI10.1145/383779.383783zbMath1365.68149MaRDI QIDQ5738917
No author found.
Publication date: 13 June 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/383779.383783
Related Items
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Twelve Definitions of a Stable Model, Quo Vadis Answer Set Programming?, Quantified Equilibrium Logic and Foundations for Answer Set Programs, Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence, Relativized Hyperequivalence of Logic Programs for Modular Programming, Program Correspondence under the Answer-Set Semantics: The Non-ground Case, Ordering default theories and nonmonotonic logic programs, A first order nonmonotonic extension of constructive logic, Strong order equivalence, Equilibrium logic, Conceptual logic programs, Default logic generalized and simplified, Hyperequivalence of logic programs with respect to supported models, Safe beliefs for propositional theories, Redundancy in logic. III: Non-monotonic reasoning, Semantic forgetting in answer set programming, Complexity results for answer set programming with bounded predicate arities and implications, Solving logic program conflict through strong and weak forgettings, Redundancy in logic. I: CNF propositional formulae, Partial equilibrium logic, Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach, Strongly Equivalent Temporal Logic Programs, Rule Calculus: Semantics, Axioms and Applications, Probabilistic reasoning with answer sets, Formal Properties of Modularisation
