A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
From MaRDI portal
Publication:3485885
DOI10.1016/0743-1066(90)90026-2zbMath0705.68091OpenAlexW2061917453MaRDI QIDQ3485885
Publication date: 1990
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(90)90026-2
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)
Related Items (11)
Logic programs and connectionist networks ⋮ Unique satisfiability of Horn sets can be solved in nearly linear time ⋮ Complexity and undecidability results for logic programming ⋮ Computing the well-founded semantics faster ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ About some UP-based polynomial fragments of SAT ⋮ On exact selection of minimally unsatisfiable subformulae ⋮ Solving the resolution-free SAT problem by submodel propagation in linear time ⋮ A short note on some tractable cases of the satisfiability problem. ⋮ A sharp threshold for the renameable-Horn and the \(q\)-Horn properties ⋮ A perspective on certain polynomial-time solvable classes of satisfiability
This page was built for publication: A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
