An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
From MaRDI portal
Publication:2124445
DOI10.1016/J.ARTINT.2022.103680OpenAlexW4210893880MaRDI QIDQ2124445FDOQ2124445
Authors: Ringo Baumann, Hannes Strass Edit this on Wikidata
Publication date: 11 April 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103680
Recommendations
- Characterizing strong equivalence for argumentation frameworks
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Knowledge representation and non-monotonic reasoning
- Characterization of strongly equivalent logic programs in intermediate logics
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
- On strong equivalence theorem for answer set semantics with strong negation
- A Characterization of Strong Equivalence for Logic Programs with Variables
Cites Work
- Nonmonotonic reasoning, preferential models and cumulative logics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Strongly equivalent logic programs
- Galois Connexions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- Characterizing strong equivalence for argumentation frameworks
- A logic for default reasoning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite argumentation frameworks. On the existence and uniqueness of extensions
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Logic Programming
- Title not available (Why is that?)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Title not available (Why is that?)
- Logic Programming and Nonmonotonic Reasoning
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Approximating operators and semantics for abstract dialectical frameworks
- Hyperequivalence of logic programs with respect to supported models
- Infinitary equilibrium logic and strongly equivalent logic programs
- On equivalence of infinitary formulas under the stable model semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients
- Static and dynamic orderings on Dungean argumentation frameworks -- an overview
- A general approach to extension-based semantics in abstract argumentation
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
- On naive labellings -- realizability, construction and patterns of redundancy
- On dynamics in structured argumentation formalisms
This page was built for publication: An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124445)
