Algorithms for the maximum satisfiability problem
- 1 December 1990
- journal article
- research article
- Published by Springer Nature in Computing
- Vol. 44 (4) , 279-303
- https://doi.org/10.1007/bf02241270
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- On the complexity of the maximum satisfiability problem for horn formulasInformation Processing Letters, 1987
- Simulated annealing methods with general acceptance probabilitiesJournal of Applied Probability, 1987
- Integrity constraints in logic databasesThe Journal of Logic Programming, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Optimization by Simulated AnnealingScience, 1983
- Algorithmic extremal problems in combinatorial optimizationJournal of Algorithms, 1982
- A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability ProblemCanadian Journal of Mathematics, 1982
- Complexity of Partial SatisfactionJournal of the ACM, 1981
- Unit Refutations and Horn SetsJournal of the ACM, 1974