Results 1 - 10
of
19
UML As Domain Specific Language For The Construction Of Knowledge-Based Configuration Systems
- International Journal of Software Engineering and Knowledge Engineering (IJSEKE
, 2000
"... Introduction Shorter product cycles, lower prices of products, and higher customer demands have created big challenges for the product development process. A successful approach to master these challenges is to employ knowledge-based systems with domain specific, high level, formal description lang ..."
Abstract
-
Cited by 56 (25 self)
- Add to MetaCart
(Show Context)
Introduction Shorter product cycles, lower prices of products, and higher customer demands have created big challenges for the product development process. A successful approach to master these challenges is to employ knowledge-based systems with domain specific, high level, formal description languages which allow a clear separation between domain knowledge and inference knowledge. These techniques can be exploited to (partially) automate the generation of software solutions. Unfortunately, in many cases, such high level, formal description languages are not integrated in the industrial software development process. In addition, these descriptions are di#cult to communicate to domain experts for reviewing purposes. This makes it demanding for software development departments to incorporate such technologies into their standard development process. Therefore, our goal is to make 449 450 A. Felfernig, G. E. Friedrich & D. Jannach such descriptions more accessible b
Representing Configuration Knowledge with Weight Constraint Rules
, 2001
"... The paper demonstrates that product configuration applications fit naturally the framework of answer set programming. It is shown that product configuration knowledge can be represented systematically and compactly using a logic program type rule language such that the answers of a configuration tas ..."
Abstract
-
Cited by 30 (4 self)
- Add to MetaCart
(Show Context)
The paper demonstrates that product configuration applications fit naturally the framework of answer set programming. It is shown that product configuration knowledge can be represented systematically and compactly using a logic program type rule language such that the answers of a configuration task, the con gurations, correspond to the models of the rule representation. The paper presents such a rule-based formalization of a unified configuration ontology using a weight constraint rule language. The language extends normal logic programs with cardinality and weight constraints which leads to a compact and simple formalization. The complexity of the configuration task de ned by the formalization is shown to be NP-complete.
A Rule-Based Formal Model For Software Configuration
, 1999
"... In this work we examine the software configuration management problem. We give a short introduction to the current state of the art and present a declarative rule-based formal language for representation of configuration knowledge. As a novel feature, the rule language allows finite existential quan ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
In this work we examine the software configuration management problem. We give a short introduction to the current state of the art and present a declarative rule-based formal language for representation of configuration knowledge. As a novel feature, the rule language allows finite existential quantification over the configuration components. We show a translation from the rule language to normal logic programs with stable model semantics. As a case study we examine the configuration management problem for the Debian GNU/Linux system which consists of over 2000 distinct software packages. We examine the current practice to identify the main components of the problem and present a way to formalize them using the rule language. We construct two formal models: one for finding valid configurations and one for diagnosing unsatisfiable user requirements. We show that the decision problem for the configuration model is NP-complete. We present a translator that reads a high-level description of the Debian configuration system and produces the corresponding set of rules. We evaluate the configuration model by using actual data from Debian version 2.1 and a set of randomly generated user requirements. The evaluation shows that the model is computationally feasible.
Interactive configuration capability in a sale support system: Laziness and focusing mechanisms
- In Proc. IJCAI-01 Configuration WS
, 2001
"... The paper discusses the configuration process in a sale support system aimed at helping a customer of a virtual store to assembly the right complex product containing the subcomponents that he/she chose and meeting her/his requirements. Because of the interaction of the customer with the system duri ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
The paper discusses the configuration process in a sale support system aimed at helping a customer of a virtual store to assembly the right complex product containing the subcomponents that he/she chose and meeting her/his requirements. Because of the interaction of the customer with the system during the configuration process, we define a lazy configurator able to configure only the portion of the complex product which is directly related to the customer’s requirements. We define also some focusing mechanisms able to use the constraints in order to reduce the search space during the configuration. 1
Problem Decomposition in Configuration
, 2002
"... In the present work the issue of decomposing a configuration problem is approached in a framework where the domain knowledge is represented in a structured way by using a KL-One like language and whole-part relations play a major role in defining the structure of the configurable objects. The repres ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
In the present work the issue of decomposing a configuration problem is approached in a framework where the domain knowledge is represented in a structured way by using a KL-One like language and whole-part relations play a major role in defining the structure of the configurable objects. The representation formalism provides also a constraint language for expressing complex relations among components and subcomponents. The paper presents a notion of boundness among constraints which assures that two components not involved in a same set of bound constraints can be independently configured. The computation of boundness among constraints is the basis for partitioning constraints associated with each component to be configured. Such a partitioning induces a decomposition of the configuration problem into independent subproblems. Both a recursive and a non recursive decomposition strategies are presented and the savings in computational time and reduction in search space are shown in the domain of PC configuration.
Star: a smart tourist agenda recommender
- World Wide Web: Internet and Information Systems
, 2004
"... In this paper we claim that the new generation of Web-based systems should offer an intelligent and flexible support to their users, coupled with the ability to provide personalized solutions. We think that prolem solving techniques could be exploited to face this challenge. In particular, we presen ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
In this paper we claim that the new generation of Web-based systems should offer an intelligent and flexible support to their users, coupled with the ability to provide personalized solutions. We think that prolem solving techniques could be exploited to face this challenge. In particular, we present STAR, a Web-based system that exploits the configuration technology in order to support a tourist in organizing a personalized agenda for a tour in a city. We describe the system architecture and the knowledge representation supporting this task. A first prototype of STAR is being implemented and it is instantiated on the city of Torino (Italy). 1
Knowledge Acquisition for Configuration Tasks: The EXPECT Approach
"... Configuration systems often use large and complex knowledge bases that need to be maintained and extended over time. The explicit representation of problem-solving knowledge and factual knowledge can greatly enhance the role of a knowledge acquisition tool by deriving from the current knowledge base ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Configuration systems often use large and complex knowledge bases that need to be maintained and extended over time. The explicit representation of problem-solving knowledge and factual knowledge can greatly enhance the role of a knowledge acquisition tool by deriving from the current knowledge base, the knowledge gaps that must be resolved. This paper details EXPECT’s approach to knowledge acquisition in the configuration domain using the propose-and-revise strategy as an example. EXPECT supports users in a variety of KA tasks like filling knowledge roles, making modifications to the knowledge base including entering new components, classes and even adapting problem-solving strategies for new tasks. EXPECT’s guidance changes as the knowledge base changes, providing a more flexible approach to knowledge acquisition. The paper also examines the possible use of EXPECT as a KA tool in the complex and real world domain of computer configuration.
Customer-adaptive and distributed online product configuration in the CAWICOMS project
- In Proceedings of the Configuration Workshop at IJCAI 01
, 2001
"... This paper reports on the goals and first results of the CAWICOMS 1 project. This EU-funded project has two main goals: The first one is providing technologies for the development of customeradaptive Web-interfaces for the configuration of masscustomized products. The second one is the integration o ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
This paper reports on the goals and first results of the CAWICOMS 1 project. This EU-funded project has two main goals: The first one is providing technologies for the development of customeradaptive Web-interfaces for the configuration of masscustomized products. The second one is the integration of configuration systems along the supplychain. Within this paper we first motivate the demand for personalized and adaptive Web-interfaces for the domain of product configuration. In addition, we sketch scenarios where product configuration takes place at several stages in the supply chain and the involved configuration systems have to cooperatively solve a distributed configuration task. An overview of the CAWICOMS architecture is given as well as first results on distributed problem solving and the integration into the surrounding enterprise's software infrastructure. 1.
Automatically decomposing configuration problems
- In LNAI, 2829
, 2003
"... Abstract. Configuration was one of the first tasks successfully approached via AI techniques. However, solving configuration problems can be computationally expensive. In this work, we show that the decomposition of a configuration problem into a set of simpler and independent subproblems can decrea ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Configuration was one of the first tasks successfully approached via AI techniques. However, solving configuration problems can be computationally expensive. In this work, we show that the decomposition of a configuration problem into a set of simpler and independent subproblems can decrease the computational cost of solving it. In particular, we describe a novel decomposition technique exploiting the compositional structure of complex objects and we show experimentally that such a decomposition can improve the efficiency of configurators. 1
Dynamic Problem Decomposition in Configuration
, 2003
"... In this work, we show how the decomposition of a problem into a set of simpler and independent subproblems can be applied to automatic configuration. In particular, we ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this work, we show how the decomposition of a problem into a set of simpler and independent subproblems can be applied to automatic configuration. In particular, we
