Unique Horn renaming and Unique 2-Satisfiability
From MaRDI portal
Publication:673674
DOI10.1016/0020-0190(95)00023-6zbMath0875.68454OpenAlexW2023908149MaRDI QIDQ673674
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00023-6
Related Items (1)
Cites Work
- Existence of simple propositional formulas
- Uniquely solvable quadratic Boolean equations
- A linear time algorithm for unique Horn satisfiability
- A linear algorithm for renaming a set of clauses as a Horn set
- On renamable Horn and generalized Horn functions
- On the unique satisfiability problem
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Recognizing disguised NR(1) instances of the satisfiability problem
- A linear control algorithm for a class of rule-based systems
- Renaming a Set of Clauses as a Horn Set
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Unique Horn renaming and Unique 2-Satisfiability
