Pages that link to "Item:Q3485885"
From MaRDI portal
The following pages link to A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability (Q3485885):
Displayed 11 items.
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← 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)
- Logic programs and connectionist networks (Q1884268) (← links)
- Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- Computing the well-founded semantics faster (Q5101445) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)