An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms

DOI10.1016/J.ARTINT.2022.103680OpenAlexW4210893880MaRDI QIDQ2124445

Ringo Baumann, Hannes Strass

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

zbMATH Keywords

logicknowledge representation formalismsstrong equivalence

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (3)

Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Static and dynamic orderings on Dungean argumentation frameworks -- an overview ⋮ A general approach to extension-based semantics in abstract argumentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing strong equivalence for argumentation frameworks
• Approximating operators and semantics for abstract dialectical frameworks
• Hyperequivalence of logic programs with respect to supported models
• A logic for default reasoning
• 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
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Infinitary equilibrium logic and strongly equivalent logic programs
• Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• The Semantics of Predicate Logic as a Programming Language
• On equivalence of infinitary formulas under the stable model semantics
• Infinite Argumentation Frameworks
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Strongly equivalent logic programs
• Galois Connexions

This page was built for publication: An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms