Compact normal forms in propositional logic and integer programming formulations

DOI10.1016/0305-0548(90)90007-TzbMATH Open0695.90064OpenAlexW2003707332MaRDI QIDQ910335FDOQ910335

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

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

zbMATH Keywords

branch and boundlinear time algorithmpropositional logicsatisfiability problems

Mathematics Subject Classification ID

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

Cites Work

• Future paths for integer programming and links to artificial intelligence
• Title not available (Why is that?)
• Modelling with integer variables
• Some results and experiments in programming techniques for propositional logic
• Title not available (Why is that?)
• Experimental Results on the New Techniques for Integer Programming Formulations
• Title not available (Why is that?)
• Using dynamic programming to determine an optimal strategy in a contract bridge tournament
• Title not available (Why is that?)

Cited In (12)

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

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)