A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
From MaRDI portal
Recommendations
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Algorithms for testing the satisfiability of propositional formulae
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences
- scientific article; zbMATH DE number 4085614
Cited in
(13)- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Computing the well-founded semantics faster
- Solving the resolution-free SAT problem by submodel propagation in linear time
- Unique satisfiability of Horn sets can be solved in nearly linear time
- Logic programs and connectionist networks
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
- A short note on some tractable cases of the satisfiability problem.
- A perspective on certain polynomial-time solvable classes of satisfiability
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Fuzzy logic programs as hypergraphs. Termination results
- Complexity and undecidability results for logic programming
- About some UP-based polynomial fragments of SAT
- On exact selection of minimally unsatisfiable subformulae
This page was built for publication: A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485885)
