Pages that link to "Item:Q1356205"
From MaRDI portal
The following pages link to Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205):
Displaying 37 items.
- Backdoors to q-Horn (Q261394) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- Horn functions and their DNFs (Q1195858) (← links)
- A linear time algorithm for unique Horn satisfiability (Q1313762) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
- Variations on extending partially defined Boolean functions with missing bits. (Q1400581) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- The complexity of theory revision (Q1606294) (← 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)
- Investigations on autark assignments (Q1841885) (← links)
- Properties of quasi-Boolean function on quasi-Boolean algebra (Q1937909) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- On connected Boolean functions (Q1961460) (← links)
- On some tractable classes in deduction and abduction (Q1978251) (← links)
- PALO: a probabilistic hill-climbing algorithm (Q2171267) (← links)
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- On the size of maximum renamable Horn sub-CNF (Q2387435) (← links)
- On propositional definability (Q2389643) (← links)
- Balanced matrices (Q2433704) (← links)
- Unique key Horn functions (Q2672584) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- A CNF Formula Hierarchy over the Hypercube (Q5385533) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
