{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:46:54Z","timestamp":1763534814978},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf01530792","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:24:51Z","timestamp":1113870291000},"page":"247-270","source":"Crossref","is-referenced-by-count":4,"title":["A hypergraph model for constraint logic programming and applications to bus drivers' scheduling"],"prefix":"10.1007","volume":"8","author":[{"given":"Paolo","family":"Carraresi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Gallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriella","family":"Rago","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"E. Aarts and J. Korst,Simulated Annealing and Boltzmann Machines (Wiley, 1989).","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G. Ausiello","year":"1986","unstructured":"G. Ausiello, A. D'Atri and D. Sacc\u00e0, Minimal representation of directed hypergraphs, SIAM J. Comput. 15(1986)418?431.","journal-title":"SIAM J. Comput."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/16894.16859"},{"key":"CR4","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge,Graphs and Hypergraphs (North-Holland, Amsterdam, 1973)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0377-2217(84)90068-7","volume":"16","author":"P. Carraresi","year":"1984","unstructured":"P. Carraresi and G. Gallo, Network models for vehicle and crew scheduling, Eur. J. Oper. Res. 16(1984)139?151.","journal-title":"Eur. J. Oper. Res."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/69.43410","volume":"1","author":"S. Ceri","year":"1989","unstructured":"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.","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/77481.77485","volume":"33","author":"V. Dhar","year":"1990","unstructured":"V. Dhar and N. Ranganathan, Integer programming vs. expert systems: An experimental comparison, Commun. ACM 33(1990)323?336.","journal-title":"Commun. ACM"},{"key":"CR8","unstructured":"M. Dincbas, Constraints, logic programming and deductive databases, in:Programming of Future Generation Computers, ed. K. Fuchi and M. Nivat (North-Holland, 1988)."},{"key":"CR9","unstructured":"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)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"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.","journal-title":"J. Logic. Progr."},{"key":"CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979)."},{"key":"CR12","unstructured":"G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applications, Technical Report No. 3\/90, Dip. Informatica, Universit\u00e0 di Pisa (1990), to appear in Discr. Appl. Math."},{"key":"CR13","unstructured":"G. Gallo and G. Rago, A hypergraph approach to logical inference for Datalog formulae, Technical Report No. 28\/90, Dip. Informatica, Universit\u00e0 di Pisa (1990)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(90)90030-L","volume":"72","author":"G.F. Italiano","year":"1990","unstructured":"G.F. Italiano and U. Nanni, Dynamic maintenance of directed hypergraphs, Theor. Comp. Sci. 72(1990)97?117.","journal-title":"Theor. Comp. Sci."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.L. Lassez, Constraint logic programming, in:Proc. 14th ACM POPL (1987) pp. 111?119.","DOI":"10.1145\/41625.41635"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671?680.","journal-title":"Science"},{"key":"CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"J.W. Lloyd","year":"1987","unstructured":"J.W. Lloyd,Foundations of logic programming, 2nd extended ed. (Springer, Berlin, 1987).","edition":"2nd extended ed"},{"key":"CR18","first-page":"99","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth, Consistency in networks of relations, AI Journal 8(1977)99?118.","journal-title":"AI Journal"},{"key":"CR19","unstructured":"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."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0306-4379(83)90024-8","volume":"8","author":"J. Minker","year":"1983","unstructured":"J. Minker and J.M. Nicolas, On recursive axioms in deductice databases, Info. Syst. 8(1983)1?13.","journal-title":"Info. Syst."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Info. Sci. 7(1974)95?132.","journal-title":"Info. Sci."},{"key":"CR22","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, New Jersey, 1982)."},{"key":"CR23","unstructured":"G. Rago, A note on top-down algorithms for propositional Horn satisfiability, Technical Report No. 18\/90, Dip. Informatica, Universit\u00e0 di Pisa (1990)."},{"key":"CR24","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck Van","year":"1989","unstructured":"P. Van Hentenryck,Constraint Satisfaction in Logic Programming (MIT Press, Cambridge, MA, 1989)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530792\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530792.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530792\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:00:57Z","timestamp":1586217657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF01530792"],"URL":"https:\/\/doi.org\/10.1007\/bf01530792","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}