A linear time algorithm for unique Horn satisfiability
Author:
- 8 November 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 48 (2) , 61-66
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Directed hypergraphs and applicationsDiscrete Applied Mathematics, 1993
- Data structures and algorithms for disjoint set union problemsACM Computing Surveys, 1991
- Uniquely solvable quadratic boolean equationsDiscrete Applied Mathematics, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- On the unique satisfiability problemInformation and Control, 1982
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972