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