Journal Article10.1109/5254.708434
Configuring large systems using generative constraint satisfaction
276
TL;DR: The authors used generative constraint satisfaction as the basis for Lava, an automated configuration they developed for the complex domain of telephone switching systems, using Cocos, their knowledge-based configuration tool.
read more
Abstract: The authors used generative constraint satisfaction as the basis for Lava, an automated configuration they developed for the complex domain of telephone switching systems. They built Lava using Cocos, their knowledge-based configuration tool.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Development of an android robot for studying human-robot interaction
Takashi Minato,Michihiro Shimada,Hiroshi Ishiguro,Shoji Itakura +3 more
- 17 May 2004
TL;DR: An android robot that has similar appearance as humans and several actuators generating micro behaviors is developed and a new research direction based on the android robot is proposed.
An efficient diagnosis algorithm for inconsistent constraint sets
TL;DR: This paper introduces a divide and conquer-based diagnosis algorithm (FastDiag) that identifies minimal sets of faulty constraints in an overconstrained problem and is specifically applicable in scenarios where the efficient identification of leading (preferred) diagnoses is crucial.
215
Uml as domain specific language for the construction of knowledge-based configuration systems
TL;DR: In this paper, a UML-Unified Modeling Language (UML-UML) is used to simplify the construction of a logic-based description of the domain knowledge.
192
A framework for the development of personalized, distributed web-based configuration systems
Liliana Ardissono,Alexander Felfernig,Gerhard Friedrich,Anna Goy,Dietmar Jannach,Giovanna Petrone,Ralph Schäfer,Markus Zanker +7 more
TL;DR: The CAWICOMS WORKBENCH for the development of configuration services, offering personalized user interaction as well as distributed configuration of products and services in a supply chain is described.
•Proceedings Article
Consistency-based diagnosis of configuration knowledge bases
Alexander Felfernig,Gerhard Friedrich,Dietmar Jannach,Markus Stumptner +3 more
- 20 Aug 2000
TL;DR: This work develops a framework suitable for diagnosing configuration knowledge bases by developing an algorithm based on conflicts that is general enough for its adaptation to diagnosing customer requirements to identify unachievable conditions during configuration sessions.
153
References
Configuration-design problem solving
Bob Wielinga,Guus Schreiber +1 more
TL;DR: To clarify configuration design problem solving, the authors provide a useful classification of the field and discuss configuration task variants and some of the major knowledge categories involved.
A knowledge-based configurator that supports sales, engineering, and manufacturing at AT&T Network Systems
Jon R. Wright,Elia S. Weixelbaum,Gregg T. Vesonder,Karen E. Brown,Stephen R. Palmer,Jay I. Berman,Harry H. Moore +6 more
TL;DR: The PROSE architecture is general and is not tied to any specific telecommunications product, as such, it is being reused to develop configurators for several different products.
132
COCOS/spl minus/a tool for constraint-based, dynamic configuration
Markus Stumptner,Alois Haselböck,Gerhard Friedrich +2 more
- 01 Mar 1994
TL;DR: Starting from general requirements on configuration systems, a language based on an extension of the constraint satisfaction problem (CSP) model is developed, which allows a simple system architecture, and a declarative description of the different types of configuration knowledge.
38
•Proceedings Article
Context in discrete Constraint Satisfaction Problems
W. Weigel,Boi Faltings,Berthe Y. Choueiry +2 more
- 01 Jan 1996
TL;DR: It is shown that CDI is related to neighborhood interchangeability within subproblems of the original CSP and polynomial time algorithms for identifying CDI sets are provided.
18
Configuration as Composite Constraint Satisfaction
Daniel Sabin,Eugene C. Freuder +1 more
- 01 Jan 1996
TL;DR: A general constraint-based model of configuration tasks represented as a new class of nonstandard constraint satisfaction problems, called composite CSP is presented, providing a more comprehensive and efficient basis for formulating and solving configuration problems.