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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Aarts and J. Korst,Simulated Annealing and Boltzmann Machines (Wiley, 1989).
G. Ausiello, A. D'Atri and D. Saccà, Minimal representation of directed hypergraphs, SIAM J. Comput. 15(1986)418–431.
F. Bancilhon and R. Ramakrishnan, An amateur's introduction to recursive query processing strategies, in:Proc. ACM SIGMOD Conf. '86, Washington (1986) pp. 16–52.
C. Berge,Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
P. Carraresi and G. Gallo, Network models for vehicle and crew scheduling, Eur. J. Oper. Res. 16(1984)139–151.
S. Ceri, G. Gottlob and L. Tanca, What you always wanted to know about Datalog (and never dared to ask), IEEE Trans. Knowledge and Data Eng. 1(1989)146–166.
V. Dhar and N. Ranganathan, Integer programming vs. expert systems: An experimental comparison, Commun. ACM 33(1990)323–336.
M. Dincbas, Constraints, logic programming and deductive databases, in:Programming of Future Generation Computers, ed. K. Fuchi and M. Nivat (North-Holland, 1988).
M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf and F. Berthier, The constraint logic programming language CHIP, in:Proc. Int. Conf. on Fifth Generation Computer Systems, FGCS'88, Tokyo, Japan (1988).
W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic. Progr. 1(1984)267–284.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applications, Technical Report No. 3/90, Dip. Informatica, Università di Pisa (1990), to appear in Discr. Appl. Math.
G. Gallo and G. Rago, A hypergraph approach to logical inference for Datalog formulae, Technical Report No. 28/90, Dip. Informatica, Università di Pisa (1990).
G.F. Italiano and U. Nanni, Dynamic maintenance of directed hypergraphs, Theor. Comp. Sci. 72(1990)97–117.
J. Jaffar and J.L. Lassez, Constraint logic programming, in:Proc. 14th ACM POPL (1987) pp. 111–119.
S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671–680.
J.W. Lloyd,Foundations of logic programming, 2nd extended ed. (Springer, Berlin, 1987).
A.K. Mackworth, Consistency in networks of relations, AI Journal 8(1977)99–118.
D.P. Mckay and S.C. Shapiro, Using active connections graphs for reasoning with recursive rules, in:Proc. 7th Int. Joint Conf. on Artificial Intelligence (1981) pp. 368–374.
J. Minker and J.M. Nicolas, On recursive axioms in deductice databases, Info. Syst. 8(1983)1–13.
U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Info. Sci. 7(1974)95–132.
C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, New Jersey, 1982).
G. Rago, A note on top-down algorithms for propositional Horn satisfiability, Technical Report No. 18/90, Dip. Informatica, Università di Pisa (1990).
P. Van Hentenryck,Constraint Satisfaction in Logic Programming (MIT Press, Cambridge, MA, 1989).
Author information
Authors and Affiliations
Additional information
This research was partially supported by the “Progetto Finalizzato Trasporti 2” of the Italian National Research Council, under Contract No. 91.02479.PF74.
Rights and permissions
About this article
Cite this article
Carraresi, P., Gallo, G. & Rago, G. A hypergraph model for constraint logic programming and applications to bus drivers' scheduling. Ann Math Artif Intell 8, 247–270 (1993). https://doi.org/10.1007/BF01530792
Issue Date:
DOI: https://doi.org/10.1007/BF01530792