{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:46:08Z","timestamp":1649097968230},"reference-count":13,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0950-7051(03)00029-7","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T18:45:52Z","timestamp":1053369952000},"page":"277-285","source":"Crossref","is-referenced-by-count":5,"title":["A polynomial algorithm for continuous non-binary disjunctive CSPs: extended DLRs"],"prefix":"10.1016","volume":"16","author":[{"given":"Miguel A.","family":"Salido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Barber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0950-7051(03)00029-7_BIB1","doi-asserted-by":"crossref","unstructured":"M. Koubarakis, Foundations of indefinite constraints databases, in: Proceedings of Second International Workshop on the Principles and Practice of Constraint Programming (PPCP-94) 874 (1994) 266\u2013280.","DOI":"10.1007\/3-540-58601-6_106"},{"key":"10.1016\/S0950-7051(03)00029-7_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint network","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0950-7051(03)00029-7_BIB3","doi-asserted-by":"crossref","unstructured":"M. Koubarakis, Tractable disjunction of linear constraints, Proceedings of Second International Conference on Principles and Practice of Constraint Programming (CP-96) (1999) 297\u2013307.","DOI":"10.1007\/3-540-61551-2_82"},{"key":"10.1016\/S0950-7051(03)00029-7_BIB4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","article-title":"Real addition and the polynomial time hierarchy","volume":"20","author":"Sontag","year":"1985","journal-title":"Information Processing Letter"},{"key":"10.1016\/S0950-7051(03)00029-7_BIB5","first-page":"19","article-title":"A canonical form for generalized linear constraints","author":"Lassez","year":"1989","journal-title":"In Advanced Seminar on Foundations of Innovative Software Development"},{"key":"10.1016\/S0950-7051(03)00029-7_BIB6","first-page":"1235","article-title":"A linear programming approach to temporal reasoning","author":"Jonssons","year":"1996","journal-title":"Proceedings of AAAI-96"},{"key":"10.1016\/S0950-7051(03)00029-7_BIB7","unstructured":"M. Salido, F. Barber, Polysa: A polinomial algorithm for non-binary constraint satisfaction problems with <= and <>, in: Proceeding of EPIA-2001 Worshop on Constraint Satisfaction and Operation Research (2001) 99\u2013113."},{"key":"10.1016\/S0950-7051(03)00029-7_BIB8","unstructured":"R. Bart\u00e1k, Constraint programming: in pursuit of the holy grail, in: Proceedings of WDS99 (invited lecture), Prague, June."},{"key":"10.1016\/S0950-7051(03)00029-7_BIB9","unstructured":"M. Koubarakis, Dense time and temporal constraints with \u2260, in: Proceedings of Third International Conference on Principles of Knowledge Representation and Reasoning (KR-92) (1992) 24\u201335."},{"key":"10.1016\/S0950-7051(03)00029-7_BIB10","unstructured":"H. Kautz, P. Ladkin, Integrating metric and temporal qualitative temporal reasoning, in: Proceedings of Ninth National Conference Artificial Intelligence (AAAI-91) (1991) 241\u2013246."},{"key":"10.1016\/S0950-7051(03)00029-7_BIB11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(95)00109-3","article-title":"Combining qualitative and quantitative constraints in temporal reasoning","volume":"87","author":"Meiri","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0950-7051(03)00029-7_BIB12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/152947.152953","article-title":"Temporal reasoning in time graph i-ii","volume":"4","author":"Gerevini","year":"1993","journal-title":"SIGART Bull"},{"key":"10.1016\/S0950-7051(03)00029-7_BIB13","doi-asserted-by":"crossref","unstructured":"M. Salido, F. Barber, An incremental and non-binary csp solver: The hyperpolyhedron search algorithm, in: Proceedings of Seventh International Conference on Principles and Practice of Constraint Programming (CP-01) (2001) 779\u2013780.","DOI":"10.1007\/3-540-45578-7_79"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705103000297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705103000297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T02:18:32Z","timestamp":1584670712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705103000297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":13,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0950705103000297"],"URL":"https:\/\/doi.org\/10.1016\/s0950-7051(03)00029-7","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}