Pages that link to "Item:Q1841885"
From MaRDI portal
The following pages link to Investigations on autark assignments (Q1841885):
Displaying 26 items.
- An overview of parallel SAT solving (Q487635) (← links)
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← links)
- Resolution cannot polynomially simulate compressed-BFS (Q1776193) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Generalized completeness for SOS resolution and its application to a new notion of relevance (Q2055868) (← links)
- Semantic relevance (Q2104509) (← links)
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Constraint satisfaction problems in clausal form. II: Minimal unsatisfiability and conflict structure (Q2895792) (← links)
- Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
- A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Does This Set of Clauses Overlap with at Least One MUS? (Q5191099) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- An Automata View to Goal-Directed Methods (Q5738990) (← links)
- Hashing-based approximate counting of minimal unsatisfiable subsets (Q6632194) (← links)
