An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences
From MaRDI portal
Publication:1097717
DOI10.1016/0020-0190(87)90200-6zbMath0635.68108MaRDI QIDQ1097717
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90200-6
DB lookup for MSC labels failed
Related Items