A linear time algorithm for unique Horn satisfiability
References (11)
- et al.
On the unique satisfiability problem
Inform. and Control
(1982) - et al.
Linear-time algorithms for testing the satisfiability of propositional Horn formulae
J. Logic Programming
(1984) - et al.
A linear-time algorithm for a special case of disjoint set union
J. Comput. System Sci.
(1985) - et al.
Directed hypergraphs and applications
Discrete Appl. Math.
(1993) - et al.
Uniquely solvable quadratic boolean equations
Discrete Appl. Math.
(1985)
There are more references available in the full text version of this article.
Cited by (7)
Complexity of pairwise shortest path routing in the grid
2004, Theoretical Computer ScienceUnique Horn renaming and Unique 2-Satisfiability
1995, Information Processing LettersHorn extensions of a partially defined boolean function
1999, SIAM Journal on ComputingAbout some UP-based polynomial fragments of SAT
2017, Annals of Mathematics and Artificial IntelligenceDichotomy theorem for the generalized unique satisfiability problem
1999, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1993 Published by Elsevier B.V.