Many-valued logic and mixed integer programming
- 1 December 1994
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 12 (3-4) , 231-263
- https://doi.org/10.1007/bf01530787
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Improving temporal logic tableaux using integer constraintsPublished by Springer Nature ,2005
- A proof of the completeness of the infinite-valued calculus of Łukasiewicz with one variablePublished by Springer Nature ,1995
- Mixed integer programming methods for computing nonmonotonic deductive databasesJournal of the ACM, 1994
- A constructive proof of McNaughton's theorem in infinite-valued logicThe Journal of Symbolic Logic, 1994
- Computation-oriented reductions of predicate to propositional logicDecision Support Systems, 1988
- A quantitative approach to logical inferenceDecision Support Systems, 1988
- Satisfiability in many-valued sentential logic is NP-completeTheoretical Computer Science, 1987
- A logic covering undefinedness in program proofsActa Informatica, 1984
- Some properties of fuzzy logicInformation and Control, 1971
- A theorem about infinite-valued sentential logicThe Journal of Symbolic Logic, 1951