Computing Maximal Autarkies with Few and Simple Oracle Queries
From MaRDI portal
Publication:3453219
DOI10.1007/978-3-319-24318-4_11zbMath1471.68250arXiv1505.02371OpenAlexW1606751955MaRDI QIDQ3453219
Oliver Kullmann, João P. Marques-Silva
Publication date: 20 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.02371
Related Items
Counting minimal unsatisfiable subsets ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ MCS Extraction with Sublinear Oracle Queries ⋮ Efficient Reasoning for Inconsistent Horn Formulae
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signsolvability revisited
- Solving satisfiability in less than \(2^ n\) steps
- The complexity of optimization problems
- The complexity of facets resolved
- Tautologies and positive solvability of linear homogeneous systems
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Pólya's permanent problem
- Investigations on autark assignments
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- A perspective on certain polynomial-time solvable classes of satisfiability
- Permanents, Pfaffian orientations, and even directed circuits
- Parallel cooperative propositional theorem proving
- Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
- On Variables with Few Occurrences in Conjunctive Normal Forms
- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
- On the Complexity of Timetable and Multicommodity Flow Problems
- Sign-consistency and solvability of constrained linear systems
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
This page was built for publication: Computing Maximal Autarkies with Few and Simple Oracle Queries
