Inicio » Software I+D

Software I+D

Desarrollo de Sistemas Software en Proyectos de Investigación



(Distributed CSP)

Sistema Software para la partición automática de CSP’s y resolución de CSP distribuidos.
Incorpora diversos criterios para la partición de un CSP global en CSP’s distribuidos, incorporando el resolvedor que obtiene una solución global a todo el CSP.
Más información en las publicaciones científico-técnicas del grupo.


(Hyperpolyhedron Search Algorithm)

HSA is an incremental and non-binary CSP solver. It carries out the search through a hyperpolyhedron that maintains those solutions that satisfy all metric non-binary temporal constraints.  This non-binary CSP is useful for problems with very large domain and few variables. Implemented in C++.


(TEmporal Scheduling SYStem)

This package performs a scheduling system based on a reasoning process on (disjunctive and interval/point based) metric temporal constraints. The scheduling problem is represented as a set of temporal constraints. Each action to be scheduled with shared resource requirements gives rise to a set of temporal constraints, which are interactively updated. Thus, the reasoning system can ensure the satisfability of each new action. At the end of the process, the system assures the consistency of the whole set of constraints (the problem is schedulable) and it can obtain one or several solutions according to several optimization criteria.


(Sistema de PLanificación INteligente)

SPLIN is a partial order planner where some modifications have been done to improve its performance. Its language for domain descriptions is an object oriented language which permits to define a domain in terms of classes and instances of these classes. SPLIN has two main modules: the domains compiler and the POP itself. It uses the least-commitment technique in steps ordering and also in variable binding. It is completely implemented in C.


(Temporal Constraint Network Manager)

The TCNM (Temporal Constraint Network Manager) package is the CommonLisp implementation of the Temporal Model described in “A metric time point and duration based Temporal Model” by F. Barber in SIGART-ACM Bulletin Vol. 4, nº 3 July (1993).
TCNM manages non-disjunctive metric temporal constraints on time-points (TCN-P) and on durations (TCN-D). These temporal primitives represent begin and end time-points and durations of temporal facts. The proposed constraints allow to express absolute, qualitative and metric constraints on time-points and on durations. They are managed in an integrated way, that is, constraints on time-points can imply constraints on durations and viceverse. The updating processes maintain a non-redundant and global consistent Temporal Constraint Network by means of an efficient and complete propagation method, with a O(n**2) temporal complexity. Sound and complete retrieval processes have a constant cost. Implemented in Common-Lisp. (Not already available).
TempoCLIPS TempoCLIPS is the integration in CLIPS of a revised implementation in ‘C’ language of the previous TCNM  package. TempoCLIPS performs temporal reasoning functionalities in CLIPS tool.(Not already available).


(disjunctive metric and symbolic temporal constraints management)

This package performs management of disjunctive metric and symbolic temporal constraints among time points and intervals in a fully integrated way. Implemented in Common-Lisp. (Not already available).