On renaming a set of clauses as a Horn set
From MaRDI portal
Publication:1120278
DOI10.1016/0020-0190(89)90229-9zbMath0672.68016OpenAlexW2069304919MaRDI QIDQ1120278
Farhad Shahrokhi, Greg Lindhorst
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90229-9
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05) Algorithms in computer science (68W99)
Related Items
On renamable Horn and generalized Horn functions, Existence of simple propositional formulas, A linear algorithm for renaming a set of clauses as a Horn set
Cites Work
