Infinitary equilibrium logic and strongly equivalent logic programs

DOI10.1016/J.ARTINT.2017.02.002MaRDI QIDQ2407875zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 6 October 2017

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2017.02.002

zbMATH Keywords

answer set programminglogic of here-and-therestrong equivalence

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Infinitary Equilibrium Logic and Strong Equivalence
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Strongly equivalent logic programs
• Strong equivalence made easy: nested expressions and weight constraints
• Strong equivalence of logic programs under the infinite-valued semantics

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 3206304 (Why is no real title available?)
• scientific article; zbMATH DE number 3250542 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• scientific article; zbMATH DE number 3099240 (Why is no real title available?)
• Abstract gringo
• Connecting first-order ASP and the logic FO(ID) through reducts
• Finite limitations on Dummett's LC
• Handbook of knowledge representation.
• Infinitary Equilibrium Logic and Strong Equivalence
• Infinitary intuitionistic logic from a classical point of view
• Introduction to Boolean Algebras
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with stable model semantics as a constraint programming paradigm
• On equivalence of infinitary formulas under the stable model semantics
• On intermediate many-valued logics
• Propositional theories are strongly equivalent to logic programs
• Proving infinitary formulas
• Strongly equivalent logic programs
• The sentential calculus with infinitely long expressions

Cited in

(27)

• Strong equivalence made easy: nested expressions and weight constraints
• Query inseparability for \(\mathcal{ALC}\) ontologies
• Propositional theories are strongly equivalent to logic programs
• An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
• Infinitary Equilibrium Logic and Strong Equivalence
• scientific article; zbMATH DE number 2108193 (Why is no real title available?)
• Autoepistemic answer set programming
• Here and There with Arithmetic
• Strong equivalence of logic programs under the infinite-valued semantics
• scientific article; zbMATH DE number 6290314 (Why is no real title available?)
• Some remarks on equivalence in infinitary and stationary logic
• On Heuer's procedure for verifying strong equivalence
• Relating two dialects of answer set programming
• Strong Equivalence of Logic Programs with Counting
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Logic Programming and Nonmonotonic Reasoning
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Sound and complete inference rules for SE-consequence
• Strong order equivalence
• A progression semantics for first-order logic programs
• Verifying Tight Logic Programs with anthem and vampire
• Logic Programming and Nonmonotonic Reasoning
• scientific article; zbMATH DE number 1884383 (Why is no real title available?)
• scientific article; zbMATH DE number 6979315 (Why is no real title available?)
• Strongly Equivalent Temporal Logic Programs
• SCL(EQ): SCL for first-order logic with equality

Describes a project that uses

Uses Software

• Gringo

This page was built for publication: Infinitary equilibrium logic and strongly equivalent logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407875)