Catálogo de publicaciones - libros
Applications of Declarative Programming and Knowledge Management: 15th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2004, and 18th Workshop on Logic Programming, WLP 2004, Potsdam, Germany, March
Dietmar Seipel ; Michael Hanus ; Ulrich Geske ; Oskar Bartenstein (eds.)
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
No disponibles.
Disponibilidad
Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
---|---|---|---|---|
No detectada | 2005 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-25560-4
ISBN electrónico
978-3-540-32124-8
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2005
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2005
Tabla de contenidos
doi: 10.1007/11415763_11
A Local Search System for Solving Constraint Problems of Declarative Graph-Based Global Constraints
Markus Bohlin
In this paper we present a local search constraint solver in which constraints are expressed using cost functions on graph structures of filter constraints of equal type. A similar theoretical approach has previously been used to model a large number of complex global constraints, which motivates the use of such a model in practice. In a local search context, we view global constraints as complex cost functions, encapsulating the structure of the constraints using a graph of variables, values and filter constraints. This representation gives us a declarative model, which can also be used to efficiently compute a cost as well as conflict levels of the variables in the constraints. We have implemented these ideas in a compositional C++ framework called , which can be used to solve systems of graph-based constraints. We demonstrate the usability of this approach on several well-known global constraints, and show by experimental results on two problems that an approach using a graph basis for global constraint modeling is not only possible in practice, but also competitive with existing constraint-based local search systems.
- Constraint Programming and Constraint Solving | Pp. 166-184
doi: 10.1007/11415763_12
Realising the Alternative Resources Constraint
Armin Wolf; Hans Schlenker
Alternative resource constraint problems have to be solved in practical applications where several resources are available for the activities to be scheduled. In this paper, we present a modular approach to solve such problems which is based on single resource constraints. Furthermore, we present a new sweeping algorithm which performs some “global” overload checking for the alternative resource constraint problem. To our knowledge, this is the first presentation where “sweeping”, a well-known technique in computational geometry, was used to perform this checking efficiently.
For a practical evaluation of our approach, we implemented and integrated it into our Java constraint engine . We compared our implementation with the more general constraint in SICStus Prolog on some benchmark problems: the publicly available .
- Constraint Programming and Constraint Solving | Pp. 185-199
doi: 10.1007/11415763_13
Integrating Time Constraints into Constraint-Based Configuration Models
Ulrich John; Ulrich Geske
Over the last few years, we have been developing the configuration model ConBaCon, which is based on Constraint Programming over finite domains. The model is sound and suitable for building efficient and flexible systems that fulfill all the requirements of advanced configuration systems.
In this paper, we present model extensions that enable time-extended configuration and reconfiguration problems to be solved: Besides “normal” configuration and reconfiguration problems, the extended model can now also solve problems that contain time-dependent resource avaibilities or supply constraints for the ground components included. The general nature of the model extensions introduced seems to be suitable for integration in other (commercial) constraint-based configuration systems/configurator libraries as well.
- Constraint Programming and Constraint Solving | Pp. 200-214
doi: 10.1007/11415763_14
Distributed Constraint-Based Railway Simulation
Hans Schlenker
In railway simulation, given timetables have to be checked against various criteria, mainly correctness and robustness. Most existing approaches use classical centralized simulation techniques. This work goes beyond that in two main aspects: We use constraint satisfaction to get rid of deadlock problems and the simulation is done distributedly for better performance. This should make it possible to solve very large railway simulation problems.
- Constraint Programming and Constraint Solving | Pp. 215-226
doi: 10.1007/11415763_15
Concurrent Engineering to Wisdom Engineering
Shuichi Fukuda
21 century will be an age of wisdom, where product development will be replaced by wisdom development. We have been producing products, but from now on, we have to move in such a direction as to satisfy higher level needs in Maslow’s Hierarchy. An age of wisdom is a world of combinations and Wisdom Engineering, which developed from Concurrent Engineering through Collaborative Engineering, and which is based upon the world of combinations, will serve extensively for wisdom development.
- Declarative Programming and Web-Based Systems | Pp. 227-244
doi: 10.1007/11415763_16
Web Services Based on and
Bernd D. Heumesser; Andreas Ludwig; Dietmar Seipel
This paper describes how the deductive power of can be made available across the Internet using standardized Web services technologies. This facilitates the use of as a component of distributed information systems and in many new application scenarios. Some of those application scenarios are discussed and one is presented in greater detail. Since a lot of information available on the Internet is nowadays based and since Web services technologies use based encodings, it is both necessary and useful to be able to process documents in itself. To make this possible, a new package for – called is introduced, making available to many of the processing facilities of the library, which is a very up–to–date and efficient implementation of most of the current related standards.
- Declarative Programming and Web-Based Systems | Pp. 245-257
doi: 10.1007/11415763_17
A Contribution to the Semantics of Xcerpt, a Web Query and Transformation Language
François Bry; Sebastian Schaffert; Andreas Schroeder
Xcerpt [1,2] is a declarative and pattern-based query and transformation language for the Web with deductive capabilities. In contrast to Web query languages like XQuery and XSLT [3,4], Xcerpt relies on concepts and techniques from logic programming and automated theorem proving such as declarative “query patterns” and “rule chaining”. Xcerpt can also be used for querying Web metadata, like OWL or RDF data [5,6], and reasoning on such metadata. In contrast to specific languages for OWL and RDF, however, Xcerpt is a general purpose query, transformation, and reasoning language, i.e. it can be used for reasoning not only with Web metadata but also with plain Web data.
- Declarative Programming and Web-Based Systems | Pp. 258-268
doi: 10.1007/11415763_18
DialogEngines – Dialog Agents for Web-Based Self Service Consulting
Oskar Bartenstein
This industrial report discusses design, implementation, and application of DialogEngines, a commercial WWW application service for business-to-consumer web based self service consulting. DialogEngines combines pseudo natural language dialog, recommendation, product presen tation, virtual character rendering with animation and voice to achieve responsive product consulting. The idea is to “help to buy” rather than “sell”. Briefly mentioned is a fielded consulting sales application.
- Declarative Programming and Web-Based Systems | Pp. 269-277
doi: 10.1007/11415763_19
Towards Ubiquitous Maintenance – Defining Invocation of Plant Maintenance Agents in Real Workspace by Spatial Programming
Hiroki Takahashi; Osamu Yoshie
Recent progress of VR (Virtual Reality) technologies makes it possible to realize the VR space that is synchronized with the real space. We can hereby build virtual workspace through which a worker in real workspace can automatically acquire and invoke appropriate plant maintenance agents. We propose spatial programming which is a manner of VR programming technique, locating various place-dependent agents and web information in VR space, and also describe the interface between agent world and real workspace as an application of spatial programming, towards ubiquitous maintenance.
- Declarative Programming and Web-Based Systems | Pp. 278-293
doi: 10.1007/11415763_20
A Pragmatic Approach to Pre-testing Prolog Programs
Christoph Beierle; Marija Kulaš; Manfred Widera
We present an overview on the AT(x) approach which is capable of automatically analyzing programs with respect to given tests and a reference solution. In the context of small homework assignments with precisely describable tasks, AT(P), a Prolog instance of the general AT(x) framework, is able to find many of the errors usually made by students and to communicate them in a manner understandable for beginners in Prolog programming. The system is being used in distance education where direct communication between students and tutors is most of the time not possible.
- Declarative Programming and Web-Based Systems | Pp. 294-308