Backdoors to tractable answer set programming
From MaRDI portal
Publication:2341833
Recommendations
Cites work
- A dynamic-programming based ASP-solver
- A fixed-parameter algorithm for the directed feedback vertex set problem
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
- A quadratic kernel for feedback vertex set
- Abstraction-based algorithm for 2QBF
- Almost 2-SAT is fixed-parameter tractable
- Answer set programming based on propositional satisfiability
- Answer Set Programming for Single-Player Games in General Game Playing
- ASSAT: computing answer sets of a logic program by SAT solvers
- Augmenting tractable fragments of abstract argumentation
- Autoepistemic logic
- Backdoor sets of quantified Boolean formulas
- Backdoors to acyclic SAT
- Backdoors to normality for disjunctive logic programs
- Backdoors to q-Horn
- Backdoors to satisfaction
- Belief Revision with Bounded Treewidth
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
- Compact translations of non-disjunctive answer set programs to propositional clauses
- Complex optimization in answer set programming
- Computational properties of argument systems satisfying graph-theoretic constraints
- Computing Stable Models via Reductions to Difference Logic
- Conflict-driven answer set solving: from theory to practice
- Detecting inconsistencies in large biological networks with answer set programming
- Directed Subset Feedback Vertex Set is fixed-parameter tractable
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Empirical study of the anatomy of modern SAT solvers
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Extending and implementing the stable model semantics
- Feedback vertex set in mixed graphs
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Fundamentals of parameterized complexity
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Graph theory
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 1670796 (Why is no real title available?)
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- scientific article; zbMATH DE number 4058868 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1149406 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1931668 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
- Improved upper bounds for vertex cover
- Infeasibility of instance compression and succinct PCPs for NP
- Limitations of restricted branching in clause learning
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Logic Programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
- Logic programs with stable model semantics as a constraint programming paradigm
- Matched formulas and backdoor sets
- Multi-criteria optimization in answer set programming
- Negation as failure using tight derivations for general logic programs
- Negation by default and unstratifiable logic programs
- NuMVC: an efficient local search algorithm for minimum vertex cover
- On problems without polynomial kernels
- On self-transformable combinatorial problems
- On the complexity of feedback set problems in signed digraphs
- On the computational cost of disjunctive logic programming: Propositional case
- On the impact of stratification on the complexity of nonmonotonic reasoning
- Parameterized algorithms for even cycle transversal
- Parametrized complexity theory.
- Permanents, Pfaffian orientations, and even directed circuits
- Preprocessing of complex non-ground rules in answer set programming
- Propositional semantics for disjunctive logic programs
- SOFSEM 2005: Theory and Practice of Computer Science
- Solving \#SAT using vertex covers
- Some consequences of non-uniform conditions on uniform classes
- Strong backdoors to nested satisfiability
- Team-building with answer set programming in the Gioia-Tauro seaport
- The complexity of propositional closed world reasoning and circumscription
- The directed subgraph homeomorphism problem
- The DLV system for knowledge representation and reasoning
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
- The even-path problem for graphs and digraphs
- The good, the bad, and the odd: cycles in answer-set programs
- The Semantics of Predicate Logic as a Programming Language
- Tight logic programs
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Tradeoffs in the Complexity of Backdoor Detection
- Transforming normal logic programs to constraint logic programs
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Unfolding partiality and disjunctions in stable model semantics
- Unsatisfiability-based optimization in clasp
Cited in
(19)- Augmenting tractable fragments of abstract argumentation
- A multiparametric view on answer set programming
- Backdoors to planning
- Strong Backdoors for Default Logic
- Answer set solver backdoors
- Abstract answer set solvers with backjumping and learning
- Clique-width and directed width measures for answer-set programming
- Backdoor sets for CSP
- The good, the bad, and the odd: cycles in answer-set programs
- Treewidth in non-ground answer set solving and alliance problems in graphs
- Backdoors to normality for disjunctive logic programs
- A paraconsistent ASP-like language with tractable model generation
- Computational Short Cuts in Infinite Domain Constraint Satisfaction
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- Backdoor DNFs
- Aspmc: new frontiers of algebraic answer set counting
- Strong backdoors for default logic
- Strong backdoors for default logic
- Backdoors into heterogeneous classes of SAT and CSP
Describes a project that uses
Uses Software
This page was built for publication: Backdoors to tractable answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2341833)
