Pages that link to "Item:Q4140416"
From MaRDI portal
The following pages link to Renaming a Set of Clauses as a Horn Set (Q4140416):
Displaying 45 items.
- Backdoors to q-Horn (Q261394) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Automatic decidability and combinability (Q549666) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- Resolution search (Q674925) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- Existence of simple propositional formulas (Q917333) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- On renaming a set of clauses as a Horn set (Q1120278) (← links)
- A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- On renamable Horn and generalized Horn functions (Q1356207) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Non-Horn clause logic programming (Q1402738) (← links)
- Renaming a set of non-Horn clauses (Q1587332) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← 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)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- On some tractable classes in deduction and abduction (Q1978251) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← links)
- Feasibility checking in Horn constraint systems through a reduction based approach (Q2344728) (← links)
- On propositional definability (Q2389643) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Properties of SLUR Formulae (Q2891367) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Computation of Renameable Horn Backdoors (Q3502704) (← links)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- Computational Aspects of Quasi-Classical Entailment (Q4443010) (← links)
- (Q5091205) (← links)
- (Q5131261) (← links)
