Backdoors to Normality for Disjunctive Logic Programs
From MaRDI portal
Publication:5277908
DOI10.1145/2818646zbMath1367.68032arXiv1301.1391OpenAlexW1973101725MaRDI QIDQ5277908
Johannes K. Fichte, Stefan Szeider
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1391
propositional satisfiabilityparameterized complexityanswer set programmingquantified Boolean formulasbackdoors
Related Items
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search, Backdoor Sets for CSP., Parameterised complexity of model checking and satisfiability in propositional dependence logic, Strong Backdoors for Default Logic, A multiparametric view on answer set programming, Backdoors to planning, Backdoors to tractable answer set programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Negation by default and unstratifiable logic programs
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer set programming based on propositional satisfiability
- Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Describing parameterized complexity classes
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- Logic programs with stable model semantics as a constraint programming paradigm
- Backdoors to tractable answer set programming
- Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Backdoors to Satisfaction
- Empirical Study of the Anatomy of Modern Sat Solvers
- Detecting inconsistencies in large biological networks with answer set programming
- Fixed-Parameter Tractable Reductions to SAT
- Computing Stable Models via Reductions to Difference Logic
- Some (in)translatability results for normal logic programs and propositional theories
- Modularity Aspects of Disjunctive Stable Models
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- The Semantics of Predicate Logic as a Programming Language
- Integrating Dependency Schemes in Search-Based QBF Solvers
- Unfolding partiality and disjunctions in stable model semantics
- Why are there so many loop formulas?
- The DLV system for knowledge representation and reasoning
- Logic Programming and Nonmonotonic Reasoning
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Improved Parameterized Upper Bounds for Vertex Cover
