On the complexity of the maximum satisfiability problem for horn formulas
- 15 September 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (1), 1-4
- https://doi.org/10.1016/0020-0190(87)90028-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Minimum cuts and related problemsNetworks, 1975