{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:07:26Z","timestamp":1725574046295},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240877"},{"type":"electronic","value":"9783540305026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30502-6_26","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:22:20Z","timestamp":1294420940000},"page":"352-362","source":"Crossref","is-referenced-by-count":1,"title":["Graph Theoretic Models for Reasoning About Time"],"prefix":"10.1007","author":[{"given":"Martin Charles","family":"Golumbic","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM\u00a026, 832\u2013843 (1983)","journal-title":"Communications of the ACM"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence\u00a049, 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"key":"#cr-split#-26_CR3.1","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980);","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"#cr-split#-26_CR3.2","unstructured":"Annals of Discrete Mathematics, 2nd edn., vol.??57. Elsevier, Amsterdam (2004)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Reasoning about time. In: Hoffman, F. (ed.) Mathematical Aspects of Artificial Intelligence. Proc. Symposia in Applied Math, vol.\u00a055, pp. 19\u201353. American Math. Society (1998)","DOI":"10.1090\/psapm\/055\/1619605"},{"key":"26_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/b106672","volume-title":"Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications","author":"M.C. Golumbic","year":"2005","unstructured":"Golumbic, M.C.: Algorithmic graph theory and its applications. In: Golumbic, M.C., Ben-Arroyo Hartman, I. (eds.) Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications. Kluwer Academic, Dordrecht (2005)"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1145\/174147.169675","volume":"40","author":"M.C. Golumbic","year":"1993","unstructured":"Golumbic, M.C., Shamir, R.: Complexity and algorithms for reasoning about time: a graph-theoretic approach. J. Assoc. Comput. Mach.\u00a040, 1108\u20131133 (1993)","journal-title":"J. Assoc. Comput. Mach."},{"key":"26_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs. Cambridge University Press, Cambridge (2004)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0004-3702(95)00109-3","volume":"87","author":"I. Meiri","year":"1996","unstructured":"Meiri, I.: Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence\u00a087, 343\u2013385 (1996)","journal-title":"Artificial Intelligence"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"Nebel, B., B\u00fcrckert, H.-J.: Reasoning about temporal relations: A maximal tractable subclass of Allen\u2019s interval algebra. J. ACM\u00a042, 43\u201366 (1995)","journal-title":"J. ACM"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","volume":"58","author":"P. VanBeek","year":"1992","unstructured":"VanBeek, P.: Reasoning about qualitative information. Artificial Intelligence\u00a058, 297\u2013326 (1992)","journal-title":"Artificial Intelligence"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1111\/j.1467-8640.1990.tb00130.x","volume":"6","author":"P. VanBeek","year":"1990","unstructured":"VanBeek, P., Cohen, R.: Exact and approximate reasoning about temporal relations. Computational Intelligence\u00a06, 132\u2013144 (1990)","journal-title":"Computational Intelligence"},{"key":"26_CR12","unstructured":"Vilain, M., Kautz, H.: Constraint propagation algorithms for temporal reasoning. In: Proc. AAAI 1986, Philadelphia, PA, pp. 377\u2013382 (1986)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01534456","volume":"15","author":"A.B. Webber","year":"1995","unstructured":"Webber, A.B.: Proof of the interval satisfiability conjecture. Annals of Mathematics and Artificial Intelligence\u00a015, 231\u2013238 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30502-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:57:56Z","timestamp":1605743876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30502-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240877","9783540305026"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30502-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}