ISSN:
1573-7470
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In a previous paper, a hypergraph model for the satisfiability of Datalog formulas was proposed. Here, we extend that approach in order to deal with a class ofconstraint logic programming (CLP) formulas, that is, Datalog formulas in the presence of constraints. A CLP formula is represented by means of a weighted hypergraph and the problem of evaluating this formula is reduced to a sequence of shortest path computations on hypergraphs. To evaluate the performance of this approach, the bus drivers' scheduling problem is formulated as the problem of checking the satisfiability of a CLP formula and it is solved by means of the hypergraph-based algorithm embedded within a local search procedure. Preliminary experimental results are quite encouraging and suggest that the proposed approach may provide an efficient way to tackle hard real-life combinatorial problems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01530792
Permalink