Modeling and integer programming techniques applied to propositional calculus

DOI10.1016/0305-0548(90)90062-CzbMath0707.03009OpenAlexW2038014203MaRDI QIDQ918954

Allen L. Soyster, Panos M. Pardalos, Tom M. Cavalier

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)90062-c

zbMATH Keywords

methods for constructing a 0-1 integer programming problem from a propositional calculus problemmethods of preprocessing the logical inferences into constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Boolean programming (90C09) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)

Related Items

Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, Improving the performance of enumerative search methods. I: Exploiting structure and intelligence, Computing sparse and dense realizations of reaction kinetic systems, Improving the performance of enumerative search methods. II: Computational experiments, Fuzzy boolean programming problems with fuzzy costs: A general study, An approach to guided learning of Boolean functions, Optimization-based approaches to control of probabilistic Boolean networks, On the minimum number of logical clauses inferred from examples, Neural logic rule layers, Modeling and Predictive Control of Nonlinear Hybrid Systems Using Mixed Logical Dynamical Formalism, An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks, Predictive control algorithms for congestion management in electric power distribution grids, Deriving conclusions in expert systems when knowledge is incomplete, A mixed-integer programming approach to multi-class data classification problem, Discrete-time hybrid modeling and verification of the batch evaporator process benchmark, Computational experience with an interior point algorithm on the satisfiability problem, Design of fixed points in Boolean networks using feedback vertex sets and model reduction, Mixed logical dynamical modeling of discrete-time hybrid fractional systems, Generating logical expressions from positive and negative examples via a branch-and-bound approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results and experiments in programming techniques for propositional logic
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• A mathematical programming approach to inference with the capability of implementing default rules
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems