Many-valued logic and mixed integer programming
From MaRDI portal
Recommendations
- Mixed logical-linear programming
- Publication:4724431
- scientific article; zbMATH DE number 1076964
- Mixed-valued logic and its applications
- Integer programs for logic constraint satisfaction
- scientific article; zbMATH DE number 1754535
- scientific article; zbMATH DE number 4049617
- Many-valued computational logics
- A unified approach to mixed-integer optimization problems with logical constraints
- scientific article; zbMATH DE number 5356404
Cites work
- scientific article; zbMATH DE number 3904558 (Why is no real title available?)
- scientific article; zbMATH DE number 42654 (Why is no real title available?)
- scientific article; zbMATH DE number 408798 (Why is no real title available?)
- scientific article; zbMATH DE number 408804 (Why is no real title available?)
- scientific article; zbMATH DE number 1349997 (Why is no real title available?)
- scientific article; zbMATH DE number 512984 (Why is no real title available?)
- scientific article; zbMATH DE number 516995 (Why is no real title available?)
- scientific article; zbMATH DE number 559756 (Why is no real title available?)
- scientific article; zbMATH DE number 1536574 (Why is no real title available?)
- scientific article; zbMATH DE number 764337 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- A constructive proof of McNaughton's theorem in infinite-valued logic
- A logic covering undefinedness in program proofs
- A theorem about infinite-valued sentential logic
- An algebraic approach to non-classical logics
- Branch-and-cut solution of inference problems in propositional logic
- Computing definite logic programs by partial instantiation
- Eliminating dublication with the hyper-linking strategy
- Generalized resolution for 0--1 linear inequalities
- Logic-based decision support. Mixed integer model formulation
- Mixed integer programming methods for computing nonmonotonic deductive databases
- New methods for computing inferences in first order logic
- Satisfiability in many-valued sentential logic is NP-complete
- Solving propositional satisfiability problems
- Some properties of fuzzy logic
- Symbolic constraint handling through unification in finite algebras
- The deduction theorem for Lukasiewicz many-valued propositional calculi
Cited in
(27)- Complexity issues in Basic Logic
- Constraint tableaux for two-dimensional fuzzy logics
- Deduction by combining semantic tableaux and integer programming
- On the refutational completeness of signed binary resolution and hyperresolution
- 1998 European Summer Meeting of the Association for Symbolic Logic
- SAT and SMT technology for many-valued logics
- MUltlog 1.0: towards an expert system for many-valued logics
- Two-layered logics for probabilities and belief functions over Belnap-Dunn logic
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- Non-distributive relatives of ETL and NFL
- Logic-based decision support. Mixed integer model formulation
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Paraconsistent Gödel modal logic
- scientific article; zbMATH DE number 1754535 (Why is no real title available?)
- scientific article; zbMATH DE number 837781 (Why is no real title available?)
- Automated theorem proving by resolution in non-classical logics
- scientific article; zbMATH DE number 5356404 (Why is no real title available?)
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- THREE CHARACTERIZATIONS OF STRICT COHERENCE ON INFINITE-VALUED EVENTS
- Lazy evaluations in Łukasiewicz type fuzzy logic
- Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic
- A \textit{DPLL} procedure with dichotomous branching for propositional product logic
- On generalized hoops, homomorphic images of residuated lattices, and (G)BL-algebras
- Introduction
- The MaxSAT problem in the real-valued MV-algebra
- Two-layered logics for paraconsistent probabilities
This page was built for publication: Many-valued logic and mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924752)
