Why are there so many loop formulas?

From MaRDI portal
Publication:5277748

DOI10.1145/1131313.1131316zbMath1367.68036OpenAlexW2079430756MaRDI QIDQ5277748

Vladimir Lifschitz, Alexander A. Razborov

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1131313.1131316




Related Items (21)

Backdoors to Normality for Disjunctive Logic ProgramsOn elementary loops of logic programsTreewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?Integrating Inductive Definitions in SATKnowledge compilation of logic programs using approximation fixpoint theorySemantic-based construction of arguments: an answer set programming approachWhat is answer set programming to propositional satisfiabilityIASCAR: incremental answer set counting by anytime refinementThe joy of probabilistic answer set programming: semantics, complexity, expressivity, inferenceWeight constraint programs with evaluable functionsLoop formulas for circumscriptionConflict-driven answer set solving: from theory to practiceFinding Reductions AutomaticallyAlternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded SetsBoosting Answer Set Optimization with Weighted Comparator NetworksAn empirical study of constraint logic programming and answer set programming solutions of combinatorial problemsAnswer Set Programming: A PrimerSome (in)translatability results for normal logic programs and propositional theoriesIteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set ProgramsQuo Vadis Answer Set Programming?On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP






This page was built for publication: Why are there so many loop formulas?