Many-valued logic and mixed integer programming
From MaRDI portal
Publication:1924752
DOI10.1007/BF01530787zbMath0856.03011OpenAlexW1977670033MaRDI QIDQ1924752
Publication date: 20 October 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01530787
integer programmingCNF formulasconstraint tableauxefficient satisfiability checking procedureNP-containmentstructure preserving clause form translation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
1998 European Summer Meeting of the Association for Symbolic Logic ⋮ Constraint tableaux for two-dimensional fuzzy logics ⋮ Automated theorem proving by resolution in non-classical logics ⋮ Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction ⋮ Two-layered logics for paraconsistent probabilities ⋮ Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers ⋮ On generalized hoops, homomorphic images of residuated lattices, and (G)BL-algebras ⋮ THREE CHARACTERIZATIONS OF STRICT COHERENCE ON INFINITE-VALUED EVENTS ⋮ Introduction ⋮ Reducing fuzzy answer set programming to model finding in fuzzy logics ⋮ MUltlog 1.0: Towards an expert system for many-valued logics ⋮ Non-distributive relatives of ETL and NFL ⋮ On the refutational completeness of signed binary resolution and hyperresolution ⋮ Lazy evaluations in Łukasiewicz type fuzzy logic ⋮ Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories ⋮ Paraconsistent Gödel modal logic ⋮ Complexity issues in Basic Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eliminating dublication with the hyper-linking strategy
- Symbolic constraint handling through unification in finite algebras
- A logic covering undefinedness in program proofs
- Satisfiability in many-valued sentential logic is NP-complete
- Logic-based decision support. Mixed integer model formulation
- The deduction theorem for Lukasiewicz many-valued propositional calculi
- An algebraic approach to non-classical logics
- New methods for computing inferences in first order logic
- Computing definite logic programs by partial instantiation
- Generalized resolution for 0--1 linear inequalities
- Branch-and-cut solution of inference problems in propositional logic
- Solving propositional satisfiability problems
- A constructive proof of McNaughton's theorem in infinite-valued logic
- Mixed integer programming methods for computing nonmonotonic deductive databases
- Some properties of fuzzy logic
- A theorem about infinite-valued sentential logic
This page was built for publication: Many-valued logic and mixed integer programming
