Strongly equivalent logic programs
From MaRDI portal
Publication:5738917
Recommendations
- scientific article; zbMATH DE number 3956409
- Discovering classes of strongly equivalent logic programs
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- Equivalent logic programs
- Strong equivalence of logic programs with abstract constraint atoms
- Strong Equivalence of Logic Programs with Counting
- Characterization of strongly equivalent logic programs in intermediate logics
- Possibilistic nested logic programs and strong equivalence
- Logic Programming and Nonmonotonic Reasoning
Cited in
(only showing first 100 items - show all)- Logic Programming and Nonmonotonic Reasoning
- Characterization of strongly equivalent logic programs in intermediate logics
- Infinitary equilibrium logic and strongly equivalent logic programs
- Semi-equilibrium models for paracoherent answer set programs
- Statistical relational extension of answer set programming
- Temporal equilibrium logic: a survey
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Merging Logic Programs under Answer Set Semantics
- On deductive bases for paraconsistent answer set semantics
- Rule Calculus: Semantics, Axioms and Applications
- Model-based recasting in answer-set programming
- Equivalence in logic-based argumentation
- The Modal Logic of Equilibrium Models
- Deciding the bisimilarity relation between Datalog goals
- Stable Models for Temporal Theories
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Lloyd-Topor completion and general stable models
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Default Negation as Explicit Negation plus Update
- \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
- Equivalence of defeasible normative systems
- First-order modular logic programs and their conservative extensions
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Relativized hyperequivalence of logic programs for modular programming
- Possibilistic nested logic programs and strong equivalence
- scientific article; zbMATH DE number 1884383 (Why is no real title available?)
- scientific article; zbMATH DE number 2090116 (Why is no real title available?)
- To Vladimir Lifschitz on His 65th Birthday
- Twelve Definitions of a Stable Model
- Equilibrium logic
- Answer Set Programming: A Primer
- Some (in)translatability results for normal logic programs and propositional theories
- Inductive equivalence in clausal logic and nonmonotonic logic programming
- Synonymous theories and knowledge representations in answer set programming
- Towards Verifying Logic Programs in the Input Language of clingo
- Nested sequents for intermediate logics: the case of Gödel-Dummett logics
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Equivalence for the G₃^-stable models semantics
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients
- On abstract modular inference systems and solvers
- On graph equivalences preserved under extensions
- From answer set logic programming to circumscription via logic of GK
- A Characterization of Strong Equivalence for Logic Programs with Variables
- A program-level approach to revising logic programs under the answer set semantics
- Infinitary Equilibrium Logic and Strong Equivalence
- Formal Properties of Modularisation
- General default logic
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- Abstraction for non-ground answer set programs
- LARS: a logic-based framework for analytic reasoning over streams
- Conceptual logic programs
- Strong order equivalence
- Ordering default theories and nonmonotonic logic programs
- A first order nonmonotonic extension of constructive logic
- Equivalence issues in abduction and induction
- Stable models and circumscription
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Characterizing strong equivalence for argumentation frameworks
- Inseparability and conservative extensions of description logic ontologies: a survey
- On the input/output behavior of argumentation frameworks
- Wright's strict finitistic logic in the classical metatheory: the propositional case
- Disjunctive Programs with Set Constraints
- Reasoning on with Defeasibility in ASP
- Forgetting in abstract argumentation: limits and possibilities
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- Strongly Equivalent Temporal Logic Programs
- Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
- A polynomial reduction of forks into logic programs
- On equivalence of infinitary formulas under the stable model semantics
- Human conditional reasoning in answer set programming
- Abstract argumentation and answer set programming: two faces of Nelson's logic
- On the configuration of more and less expressive logic programs
- Aggregate semantics for propositional answer set programs
- A brief history of updates of answer-set programs
- How to build your own ASP-based system?!
- Forgetting in answer set programming -- a survey
- Skepticism relations for comparing argumentation semantics
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- A denotational semantics for equilibrium logic
- scientific article; zbMATH DE number 7453102 (Why is no real title available?)
- Safe beliefs for propositional theories
- Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
- Cumulativity Tailored for Nonmonotonic Reasoning
- Relational theories with null values and non-Herbrand stable models
- Forgetting in ASP: the forgotten properties
- Abstract gringo
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Characterization of logic program revision as an extension of propositional revision
- Quo Vadis Answer Set Programming?
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- Discovering classes of strongly equivalent logic programs
- On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
- Here and There with Arithmetic
- Static and dynamic orderings on Dungean argumentation frameworks -- an overview
- On uniform equivalence of epistemic logic programs
- Inlining external sources in answer set programs
- Omission-based abstraction for answer set programs
This page was built for publication: Strongly equivalent logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738917)
