Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Generating all maximal models of a Boolean expression
Information Processing Letters
Product Configuration Frameworks-A Survey
IEEE Intelligent Systems
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Constraint solving and preference activation for interactive design
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Efficient interactive configuration of unbounded modular systems
Proceedings of the 2006 ACM symposium on Applied computing
Feature Diagrams: A Survey and a Formal Semantics
RE '06 Proceedings of the 14th IEEE International Requirements Engineering Conference
Reasoning about Feature Models in Higher-Order Logic
SPLC '07 Proceedings of the 11th International Software Product Line Conference
On the Design and Development of Program Families
IEEE Transactions on Software Engineering
Model Construction with External Constraints: An Interactive Journey from Semantics to Syntax
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Found ations of assumption-based truth maintenance systems: preliminary report
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The complexity of closed world reasoning and circumscription
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Automated reasoning on feature models
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
Variability modeling in the real: a perspective from the operating systems domain
Proceedings of the IEEE/ACM international conference on Automated software engineering
Counterexample guided abstraction refinement algorithm for propositional circumscription
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Generating range fixes for software configuration
Proceedings of the 34th International Conference on Software Engineering
On lazy and eager interactive reconfiguration
Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems
| Hi-index | 0.00 |
When configuring customizable software, it is useful to provide interactive tool-support that ensures that the configuration does not breach given constraints. But, when is a configuration complete and how can the tool help the user to complete it? We formalize this problem and relate it to concepts from non-monotonic reasoning well researched in Artificial Intelligence. The results are interesting for both practitioners and theoreticians. Practitioners will find a technique facilitating an interactive configuration process and experiments supporting feasibility of the approach. Theoreticians will find links between well-known formal concepts and a concrete practical application.