Arc and path consistence revisited
Artificial Intelligence
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
The complexity of Boolean functions
The complexity of Boolean functions
Finding the Optimal Variable Ordering for Binary Decision Diagrams
IEEE Transactions on Computers
Arc consistency for factorable relations
Artificial Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Arc-consistency and arc-consistency again
Artificial Intelligence
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Unique satisfiability of Horn sets can be solved in nearly linear time
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
AnnoDomini: from type theory to Year 2000 conversion tool
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
From checking to inference via driving and dag grammars
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A Tutorial on Stålmarck‘s Proof Procedure for PropositionalLogic
Formal Methods in System Design - Special issue on formal methods for computer-added design
Learning Heuristics for OBDD Minimization by Evolutionary Algorithms
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Semantic definitions in REFAL and the automatic production of compilers
Semantics-Directed Compiler Generation, Proceedings of a Workshop
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Agents' roles in B2C e-commerce
AI Communications
A MuDDy Experience---ML Bindings to a BDD Library
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
| Hi-index | 0.00 |
A product line is a set of products and features with constraints on which subsets are available. Numerous configurators have been made available by product line vendors on the internet, in which procurers can experiment with the different options, e.g. how the selection of one product or feature entails or precludes the selection of another product or feature.We explore an approach to configuration inspired by type inference technology. The main contributions of the paper are a formalization of the configuration problem that includes aspects related to the interactive dialogue between the user and the system, a result stating that the configuration problem thus formalized has at least exponential complexity, and some techniques for computing approximate solutions more efficiently. While a substantial number of papers precede the present one in formalizing configuration as a constraint satisfaction problem, few address the aspects concerning interactivity between the user and the system.