Computational experience with an interior point algorithm on the satisfiability problem
- 1 December 1990
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 25 (1) , 43-58
- https://doi.org/10.1007/bf02283686
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Modeling and integer programming techniques applied to propositional calculusComputers & Operations Research, 1990
- Generalized resolution and cutting planesAnnals of Operations Research, 1988
- Computation-oriented reductions of predicate to propositional logicDecision Support Systems, 1988
- A quantitative approach to logical inferenceDecision Support Systems, 1988
- Resolution vs. cutting plane solution of inference problems: Some computational experienceOperations Research Letters, 1988
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalitiesMathematical Programming, 1986
- Some results and experiments in programming techniques for propositional logicComputers & Operations Research, 1986
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960
- A method for the solution of certain non-linear problems in least squaresQuarterly of Applied Mathematics, 1944