A linear algorithm for renaming a set of clauses as a Horn set
From MaRDI portal
Publication:1318709
DOI10.1016/0304-3975(94)90015-9zbMath0787.03009OpenAlexW2031435353WikidataQ56482742 ScholiaQ56482742MaRDI QIDQ1318709
Publication date: 5 April 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90015-9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Disjunctive closures for knowledge compilation ⋮ On \(k\)-positive satisfiability problem ⋮ Unique Horn renaming and Unique 2-Satisfiability ⋮ Sorting, linear time and the satisfiability problem ⋮ A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
Cites Work
- On renaming a set of clauses as a Horn set
- On renamable Horn and generalized Horn functions
- 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
- On the Complexity of Timetable and Multicommodity Flow Problems
- Renaming a Set of Clauses as a Horn Set
- Theorem-Proving for Computers: Some Results on Resolution and Renaming
This page was built for publication: A linear algorithm for renaming a set of clauses as a Horn set
