Unique Horn renaming and Unique 2-Satisfiability
From MaRDI portal
Publication:673674
DOI10.1016/0020-0190(95)00023-6zbMATH Open0875.68454OpenAlexW2023908149MaRDI QIDQ673674FDOQ673674
Authors: Jean-Jacques Hébrard 
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
Recommendations
- A linear time algorithm for unique Horn satisfiability
- The unique Horn-satisfiability problem and quadratic Boolean equations.
- Unique satisfiability of Horn sets can be solved in nearly linear time
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
- On the unique satisfiability problem
- scientific article; zbMATH DE number 8776
- Uniquest: Determining the Semantics of Complex Uniqueness Constraints
- scientific article; zbMATH DE number 3892614
- On renaming a set of clauses as a Horn set
- Satisfiability of mixed Horn formulas
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Renaming a Set of Clauses as a Horn Set
- Existence of simple propositional formulas
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A linear algorithm for renaming a set of clauses as a Horn set
- Recognizing disguised NR(1) instances of the satisfiability problem
- A linear time algorithm for unique Horn satisfiability
- Uniquely solvable quadratic Boolean equations
- On renamable Horn and generalized Horn functions
- On the unique satisfiability problem
- A linear control algorithm for a class of rule-based systems
Cited In (5)
This page was built for publication: Unique Horn renaming and Unique 2-Satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673674)
