Compact normal forms in propositional logic and integer programming formulations

DOI10.1016/0305-0548(90)90007-TMaRDI QIDQ910335zbMATH OpenOpenAlexFDO

Authors 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 boundlinear time algorithmpropositional logicsatisfiability problems

Mathematics Subject Classification ID

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

Recommendations

• Logic applied to integer programming and integer programming applied to logic
• Some results and experiments in programming techniques for propositional logic
• Modeling and integer programming techniques applied to propositional calculus
• Logic-based decision support. Mixed integer model formulation
• Logic and integer programming

Cites work

• scientific article; zbMATH DE number 3664336 (Why is no real title available?)
• scientific article; zbMATH DE number 3598222 (Why is no real title available?)
• scientific article; zbMATH DE number 3400670 (Why is no real title available?)
• scientific article; zbMATH DE number 3420722 (Why is no real title available?)
• Experimental Results on the New Techniques for Integer Programming Formulations
• Future paths for integer programming and links to artificial intelligence
• Modelling with integer variables
• Some results and experiments in programming techniques for propositional logic
• Using dynamic programming to determine an optimal strategy in a contract bridge tournament

Cited in

(12)

• Mass customization and ``forecasting options' penetration rates problem
• Modeling and integer programming techniques applied to propositional calculus
• Branching rules for satisfiability
• An algorithm for generalized fuzzy binary linear programming problems
• A linear and discrete programming framework for representing qualitative knowledge
• Mixed logical-linear programming
• Fuzzy boolean programming problems with fuzzy costs: A general study
• Logic-based decision support. Mixed integer model formulation
• Propositional Compilation for All Normal Parameter Reductions of a Soft Set
• Deriving conclusions in expert systems when knowledge is incomplete
• A linear-time transformation of linear inequalities into conjunctive normal form
• scientific article; zbMATH DE number 4199606 (Why is no real title available?)

This page was built for publication: Compact normal forms in propositional logic and integer programming formulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910335)