Many-valued logic and mixed integer programming

DOI10.1007/BF01530787zbMATH Open0856.03011OpenAlexW1977670033MaRDI QIDQ1924752FDOQ1924752

Authors: Reiner Hähnle 

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

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

zbMATH Keywords

integer programmingCNF formulasconstraint tableauxefficient satisfiability checking procedureNP-containmentstructure preserving clause form translation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Classical propositional logic (03B05) Many-valued logic (03B50) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Generalized resolution for 0--1 linear inequalities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Satisfiability in many-valued sentential logic is NP-complete
• An algebraic approach to non-classical logics
• A theorem about infinite-valued sentential logic
• Eliminating dublication with the hyper-linking strategy
• Branch-and-cut solution of inference problems in propositional logic
• A logic covering undefinedness in program proofs
• Title not available (Why is that?)
• Logic-based decision support. Mixed integer model formulation
• Solving propositional satisfiability problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A constructive proof of McNaughton's theorem in infinite-valued logic
• Mixed integer programming methods for computing nonmonotonic deductive databases
• Symbolic constraint handling through unification in finite algebras
• Some properties of fuzzy logic
• The deduction theorem for Lukasiewicz many-valued propositional calculi
• Title not available (Why is that?)
• New methods for computing inferences in first order logic
• Computing definite logic programs by partial instantiation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (25)

• Complexity issues in Basic Logic
• Deduction by combining semantic tableaux and integer programming
• Constraint tableaux for two-dimensional fuzzy logics
• 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
• 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
• Paraconsistent Gödel modal logic
• Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automated theorem proving by resolution in non-classical logics
• Title not available (Why is that?)
• Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
• THREE CHARACTERIZATIONS OF STRICT COHERENCE ON INFINITE-VALUED EVENTS
• A \textit{DPLL} procedure with dichotomous branching for propositional product logic
• Lazy evaluations in Łukasiewicz type fuzzy logic
• Introduction
• On generalized hoops, homomorphic images of residuated lattices, and (G)BL-algebras
• 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)