Many-valued logic and mixed integer programming
type: Item
instance of: scholarly article
title: Many-valued logic and mixed integer programming
zbMATH Open document ID: 0856.03011
DOI: 10.1007/BF01530787
author: Reiner Hähnle
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 937254
zbMATH Keywords: constraint tableaux
zbMATH Keywords: CNF formulas
zbMATH Keywords: integer programming
zbMATH Keywords: efficient satisfiability checking procedure
zbMATH Keywords: NP-containment
zbMATH Keywords: structure preserving clause form translation
MaRDI profile type: Publication
cites work: A logic covering undefinedness in program proofs
cites work: Mixed integer programming methods for computing nonmonotonic deductive databases
cites work: Symbolic constraint handling through unification in finite algebras
cites work: Q4265389
cites work: Q4289327
cites work: Q4518443
cites work: Q4282514
cites work: Branch-and-cut solution of inference problems in propositional logic
cites work: Q4202942
cites work: Generalized resolution for 0--1 linear inequalities
cites work: New methods for computing inferences in first order logic
cites work: Logic-based decision support. Mixed integer model formulation
cites work: Solving propositional satisfiability problems
cites work: Computing definite logic programs by partial instantiation
cites work: Some properties of fuzzy logic
cites work: Eliminating dublication with the hyper-linking strategy
cites work: A theorem about infinite-valued sentential logic
cites work: Satisfiability in many-valued sentential logic is NP-complete
cites work: Q4281693
cites work: Q4202949
cites work: A constructive proof of McNaughton's theorem in infinite-valued logic
cites work: Q4836220
cites work: The deduction theorem for Lukasiewicz many-valued propositional calculi
cites work: An algebraic approach to non-classical logics
cites work: Q3992496
cites work: Q3682462
cites work: Q5560258
full work available at URL: https://doi.org/10.1007/bf01530787
OpenAlex ID: W1977670033
Recommended article: Mixed logical-linear programming
Recommended article: Q4724431
Recommended article: Q4360108
Recommended article: Mixed-valued logic and its applications
Recommended article: Integer programs for logic constraint satisfaction
Recommended article: Q4534923
Recommended article: Q3786468
Recommended article: Many-valued computational logics
Recommended article: A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
Recommended article: Q3533554
description: scientific article; zbMATH DE number 937254