Infinitary Equilibrium Logic and Strong Equivalence

DOI10.1007/978-3-319-23264-5_33MaRDI QIDQ3449222zbMATH OpenOpenAlexFDO

Authors

Publication date 4 November 2015

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23264-5_33

Mathematics Subject Classification ID

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

Recommendations

• Infinitary equilibrium logic and strongly equivalent logic programs
• Strong equivalence of logic programs under the infinite-valued semantics
• Some remarks on equivalence in infinitary and stationary logic
• scientific article; zbMATH DE number 6979315
• A denotational semantics for equilibrium logic
• scientific article; zbMATH DE number 1858070
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• The equational logic of fixed points
• Equivalential and algebraizable logics
• On elementary equivalence for equality-free logic

Cites work

• Connecting first-order ASP and the logic FO(ID) through reducts
• Finite limitations on Dummett's LC
• 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 3099240 (Why is no real title available?)
• Infinitary intuitionistic logic from a classical point of view
• Logic Programming and Nonmonotonic Reasoning
• On equivalence of infinitary formulas under the stable model semantics
• On intermediate many-valued logics
• Propositional theories are strongly equivalent to logic programs
• Strongly equivalent logic programs
• The sentential calculus with infinitely long expressions

Cited in

(21)

• On elementary equivalence for equality-free logic
• Infinitary definitions of equivalence relations in models of PA
• Infinitary equilibrium logic and strongly equivalent logic programs
• Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
• Strong equivalence of logic programs with abstract constraint atoms
• Stable Models for Temporal Theories
• scientific article; zbMATH DE number 3570443 (Why is no real title available?)
• scientific article; zbMATH DE number 1961528 (Why is no real title available?)
• scientific article; zbMATH DE number 6979315 (Why is no real title available?)
• Stable models for infinitary formulas with extensional atoms
• Proving infinitary formulas
• scientific article; zbMATH DE number 1858070 (Why is no real title available?)
• scientific article; zbMATH DE number 1884383 (Why is no real title available?)
• scientific article; zbMATH DE number 2108193 (Why is no real title available?)
• Strong Equivalence of Logic Programs with Counting
• scientific article; zbMATH DE number 6290314 (Why is no real title available?)
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Propositional theories are strongly equivalent to logic programs
• On Heuer's procedure for verifying strong equivalence
• Some remarks on equivalence in infinitary and stationary logic
• Strong equivalence of logic programs under the infinite-valued semantics

This page was built for publication: Infinitary Equilibrium Logic and Strong Equivalence

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