Strongly equivalent logic programs
From MaRDI portal
Publication:5738917
DOI10.1145/383779.383783zbMath1365.68149OpenAlexW1985274317MaRDI 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
An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms, On abstract modular inference systems and solvers, Equivalence issues in abduction and induction, Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version, An extension of the stable semantics via Lukasiewicz logic, Stable Models for Temporal Theories, Infinitary Equilibrium Logic and Strong Equivalence, To Vladimir Lifschitz on His 65th Birthday, Here and There among Logics for Logic Programming, Strong Equivalence of RASP Programs, Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs, Bi-state Logic, Applying Visible Strong Equivalence in Answer-Set Program Transformations, Disjunctive Programs with Set Constraints, The Modal Logic of Equilibrium Models, A polynomial reduction of forks into logic programs, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Deciding the Bisimilarity Relation between Datalog Goals, LARS: a logic-based framework for analytic reasoning over streams, Strong order equivalence, Equilibrium logic, Conceptual logic programs, Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach, Redundancy in logic. III: Non-monotonic reasoning, Semantic forgetting in answer set programming, Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility, The rise and fall of semantic rule updates based onSE-models, Preserving Strong Equivalence while Forgetting, Characterizing causal action theories and their implementations in answer set programming, Infinitary equilibrium logic and strongly equivalent logic programs, Temporal equilibrium logic: a survey, Equivalence of defeasible normative systems, RASP and ASP as a fragment of linear logic, Model-based recasting in answer-set programming, On deductive bases for paraconsistent answer set semantics, Equivalence in logic-based argumentation, Dealing with explicit preferences and uncertainty in answer set programming, When you must forget: Beyond strong persistence when forgetting in answer set programming, On equivalence of infinitary formulas under the stable model semantics, Abstract gringo, Dual-normal logic programs – the forgotten class, Rewriting recursive aggregates in answer set programming: back to monotonicity, A denotational semantics for equilibrium logic, Characterization of logic program revision as an extension of propositional revision, First-order modular logic programs and their conservative extensions, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Inductive equivalence in clausal logic and nonmonotonic logic programming, Synonymous theories and knowledge representations in answer set programming, Complexity results for answer set programming with bounded predicate arities and implications, On updates of hybrid knowledge bases composed of ontologies and rules, Characterizing strong equivalence for argumentation frameworks, Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey, On the limits of forgetting in answer set programming, Handling and measuring inconsistency in non-monotonic logics, Strongly Equivalent Temporal Logic Programs, Rule Calculus: Semantics, Axioms and Applications, First-order satisfiability in Gödel logics: an NP-complete fragment, Capturing equilibrium models in modal logic, On the input/output behavior of argumentation frameworks, Solving logic program conflict through strong and weak forgettings, Redundancy in logic. I: CNF propositional formulae, Partial equilibrium logic, Relational theories with null values and non-herbrand stable models, Merging Logic Programs under Answer Set Semantics, Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs, Skepticism relations for comparing argumentation semantics, On graph equivalences preserved under extensions, Stable models and circumscription, From answer set logic programming to circumscription via logic of GK, Towards closed world reasoning in dynamic open worlds, A program-level approach to revising logic programs under the answer set semantics, Thirteen Definitions of a Stable Model, Equivalence for the \(G_3^\prime\)-stable models semantics, Ordering default theories and nonmonotonic logic programs, Safe beliefs for propositional theories, General default logic, Strong equivalence of logic programs under the infinite-valued semantics, Equivalence between answer-set programs under (partially) fixed input, Probabilistic reasoning with answer sets, Formal Properties of Modularisation, On syntactic forgetting under uniform equivalence, Model reconciliation in logic programs, Autoepistemic equilibrium logic and epistemic specifications, Answer Set Programming: A Primer, Well-Founded and Partial Stable Semantics Logical Aspects, Default logic generalized and simplified, 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, Forgetting in ASP: The Forgotten Properties, Strong inconsistency, Query inseparability for \(\mathcal{ALC}\) ontologies, First-order stable model semantics with intensional functions, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Forgetting auxiliary atoms in forks, Choice logics and their computational properties, Possibilistic nested logic programs and strong equivalence, SAT-based proof search in intermediate propositional logics, A first order nonmonotonic extension of constructive logic, Semi-equilibrium models for paracoherent answer set programs, Strong Equivalence of Logic Programs with Counting, Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis, Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective, Towards Verifying Logic Programs in the Input Language of clingo, Default Negation as Explicit Negation plus Update, Unnamed Item, Here and There with Arithmetic, Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming, Reasoning on with Defeasibility in ASP, Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs, Static and dynamic orderings on Dungean argumentation frameworks -- an overview, On Uniform Equivalence of Epistemic Logic Programs, Revisiting Explicit Negation in Answer Set Programming, A Syntactic Operator for Forgetting that Satisfies Strong Persistence, Statistical relational extension of answer set programming, Wright's strict finitistic logic in the classical metatheory: the propositional case, Nested sequents for intermediate logics: the case of Gödel-Dummett logics, Unnamed Item, Unnamed Item, Modular Answer Set Programming as a Formal Specification Language, ASP (): Answer Set Programming with Algebraic Constraints, Lloyd-Topor completion and general stable models, Cumulativity Tailored for Nonmonotonic Reasoning, Open Problems in Abstract Argumentation, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Inlining External Sources in Answer Set Programs, Omission-Based Abstraction for Answer Set Programs, Abstraction for non-ground answer set programs, Gelfond-Zhang aggregates as propositional formulas, 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, A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
