Projection, consistency, and George Boole
From MaRDI portal
Publication:265702
DOI10.1007/s10601-015-9201-2zbMath1396.03041OpenAlexW1134418794MaRDI QIDQ265702
Publication date: 12 April 2016
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-015-9201-2
Related Items
Constraint programming and operations research, Achieving consistency with cutting planes, The Boolean Constraint Solver of SWI-Prolog (System Description)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrated methods for optimization
- On the system of two all different\(\_\)predicates
- Probabilistic logic
- Partitioning procedures for solving mixed-variables programming problems
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
- Generalized resolution for 0--1 linear inequalities
- Practical issues on the projection of polyhedral sets
- A linear programming approach to reasoning about probabilities
- Logic-based Benders decomposition
- Introducing global constraints in CHIP
- Merging the local and global approaches to probabilistic satisfiability
- Graph coloring inequalities from all-different systems
- A polyhedral approach to the \textit{alldifferent} system
- Discrete Optimization with Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- On the Facial Structure of the Alldifferent System
- A Way to Simplify Truth Functions
- Planning and Scheduling by Logic-Based Benders Decomposition
- Revisiting the Sequence Constraint
- Solution Enumeration for Projected Boolean Search Problems
- A Sufficient Condition for Backtrack-Free Search
- Column Generation Methods for Probabilistic Logic
- Multivalued Decision Diagrams for Sequencing Problems
- A Hybrid Method for Probabilistic Satisfiability
- Parallel Combinatorial Optimization with Decision Diagrams
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- The Problem of Simplifying Truth Functions
- Principles and Practice of Constraint Programming – CP 2004