Compact normal forms in propositional logic and integer programming formulations

DOI10.1016/0305-0548(90)90007-TzbMath0695.90064OpenAlexW2003707332MaRDI QIDQ910335

John M. Wilson

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90007-t

zbMATH Keywords

branch and boundpropositional logiclinear time algorithmsatisfiability problems

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Classical propositional logic (03B05)

Related Items

A linear-time transformation of linear inequalities into conjunctive normal form, Branching rules for satisfiability, Fuzzy boolean programming problems with fuzzy costs: A general study, Mass Customization and “Forecasting Options’ Penetration Rates Problem”, Mixed logical-linear programming, Deriving conclusions in expert systems when knowledge is incomplete, An algorithm for generalized fuzzy binary linear programming problems, A linear and discrete programming framework for representing qualitative knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results and experiments in programming techniques for propositional logic
• Future paths for integer programming and links to artificial intelligence
• Modelling with integer variables
• Using dynamic programming to determine an optimal strategy in a contract bridge tournament
• Experimental Results on the New Techniques for Integer Programming Formulations