Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Embedding boolean expressions into logic programming
Journal of Symbolic Computation
Using enumerative methods for Boolean unification
Constraint logic programming
A study on Boolean constraint solvers
Constraint logic programming
Boolean algorithms in Prolog III
Constraint logic programming
Over-Constrained Systems
Preliminary Formalization of an Incremental Hierarchical Constraint Solver
EPIA '93 Proceedings of the 6th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Over-Constrained Systems
| Hi-index | 0.00 |
This paper extends a constraint solver over the booleans to make it defeasible, and embeddable in a general architecture for defeasible constraint solving. This complements previous work on defeasible solvers over finite domains and rational numbers. Similar to the latter, one approach uses witness variables to detect minimal conflict sets of constraints, but adds important overhead. Other approaches use data dependencies, as in finite domains, to detect conflict sets. Although these are not minimal, such approaches seem more promising due to their less complexity.