Recommendations
- Automating induction for solving Horn clauses
- On a generalization of Horn constraint systems
- Compactly generating all satisfying truth assignments of a Horn formula
- Solving constrained Horn clauses using dependence-disjoint expansions
- Tree automata-based refinement with application to Horn clause verification
- Horn clause solvers for program verification
- Hardness results for approximate pure Horn CNF formulae minimization
- HORNLOG: A graph-based interpreter for general Horn clauses
- Efficient CTL verification via Horn constraints solving
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 1324220 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- A short note on some tractable cases of the satisfiability problem.
- Introduction to Mathematics of Satisfiability
- Investigations on autark assignments
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- On the Complexity of Timetable and Multicommodity Flow Problems
- Parallel cooperative propositional theorem proving
- Polynomial-time inference of all valid implications for Horn and related formulae
- Renaming a Set of Clauses as a Horn Set
- Solving satisfiability in less than \(2^ n\) steps
- Some results and experiments in programming techniques for propositional logic
- Unit Refutations and Horn Sets
This page was built for publication: Autark assignments of Horn CNFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742887)
