{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:20:48Z","timestamp":1747549248634,"version":"3.32.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":[[1992,6]]},"DOI":"10.1007\/bf01543475","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T02:14:28Z","timestamp":1113963268000},"page":"163-189","source":"Crossref","is-referenced-by-count":12,"title":["Computational complexity and constraint logic programming languages"],"prefix":"10.1007","volume":"5","author":[{"given":"Jim","family":"Cox","sequence":"first","affiliation":[]},{"given":"Ken","family":"McAloon","sequence":"additional","affiliation":[]},{"given":"Carol","family":"Tretkoff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"J. Canny, Some algebraic and geometric computations in PSPACE,ACM Symp. on Theory of Computing (1988).","key":"CR1","DOI":"10.1145\/62212.62257"},{"doi-asserted-by":"crossref","unstructured":"A. Chandra, H. Lewis and J. Makowsky, Embedded implicational dependencies and their inference problem,ACM Symp. on Theory of Computing (1981) pp. 342?354.","key":"CR2","DOI":"10.1145\/800076.802488"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"A. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM 28 (1981) 114?133.","journal-title":"J. ACM"},{"unstructured":"A. Colmerauer, Opening the Prolog III universe: a new generation of Prolog promises some powerful capabilities, BYTE (Aug. 1987) 177?182.","key":"CR4"},{"unstructured":"A.L. Christov and D.Y. Grigor'ev, Complexity of quantifier elimination in the theory of algebraically closed fields, J. Symbolic Comput. (1988).","key":"CR5"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1090\/pspum\/028.2\/0432534","volume":"28","author":"M. Davis","year":"1976","unstructured":"M. Davis, Y. Matiasevitch and J. Robinson,Proc. Symp. in Pure Mathematics: Mathematical Developments Arising From Hilbert Problems, vol. 28 (1976) pp. 323?378.","journal-title":"Proc. Symp. in Pure Mathematics: Mathematical Developments Arising From Hilbert Problems"},{"unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf and F. Berthier, The Constraint Logic Programming language CHIP,Proc. Int. Conf. on Fifth Generation Computing Systems (1988).","key":"CR7"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.12.1.50","volume":"12","author":"P. Domich","year":"1987","unstructured":"P. Domich, R. Kannan and L. Trotter, Hermite normal form computation using modulo determinant arithmetic, Math. Oper. Res. 12 (1987) 50?59.","journal-title":"Math. Oper. Res."},{"unstructured":"G. Gallo and B. Mishra, Efficient algorithms and bounds for Wu-Ritt characteristic sets, N.Y.U.-Courant Institute Technical Report No. 478 (1989).","key":"CR9"},{"doi-asserted-by":"crossref","unstructured":"D. Ierardi, Quantifier elimination in the theory of an algebraically-closed field,ACM Symp. on Theory of Computing (1989).","key":"CR10","DOI":"10.1145\/73007.73020"},{"doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.L. Lassez, Constraint Logic Programming, Monash University Technical Report (1986).","key":"CR11","DOI":"10.1145\/41625.41635"},{"doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.L. Lassez, Constraint Logic Programming,Principles of Programming Languages (Munich, 1987).","key":"CR12","DOI":"10.1145\/41625.41635"},{"unstructured":"J. Jaffar and S. Michaylov, Methodology and implementation of a CLP system,Proc. 1987 Logic Programming Conf., Melbourne (MIT Press, 1987).","key":"CR13"},{"key":"CR14","first-page":"107","volume":"3","author":"N. Jones","year":"1977","unstructured":"N. Jones and W. Laaser, Complete problems for deterministic polynomial time, Theor. Comput. Sci. 3 (1977) 107?117.","journal-title":"Theor. Comput. Sci."},{"unstructured":"P. Kanellakis, G. Kuper and P. Revesz, Constraint query languages,Principles of DataBase Systems (Nashville, 1990).","key":"CR15"},{"unstructured":"J.-L. Lassez and K. McAloon, Applications of a canonical form for generalized linear constraints,Proc. 1988 Fifth Generation Computing Systems Conf., Tokyo (1988) pp. 703?710.","key":"CR16"},{"unstructured":"J.-L. Lassez and K. McAloon, A canonical form for generalized linear constraints, to appear in J. Symbolic Comput.","key":"CR17"},{"doi-asserted-by":"crossref","unstructured":"J. Lloyd,Foundations of Logic Programming (Springer, 1984).","key":"CR18","DOI":"10.1007\/978-3-642-96826-6"},{"unstructured":"M.J. Maher, Logic semantics for a class of committed-choice programs,Proc. 1987 Logic Programming Conf., Melbourne (MIT Press, 1987) pp. 858?876.","key":"CR19"},{"unstructured":"D. Maier and D.S. Warren,Computing with Logic (Addison-Wesley, 1988).","key":"CR20"},{"doi-asserted-by":"crossref","unstructured":"V. Marek, A. Nerode and J. Remmel, A theory of non-monotonic rule systems,Logic in Computer Science '90, pp. 79?94.","key":"CR21","DOI":"10.1109\/LICS.1990.113736"},{"key":"CR22","first-page":"354","volume":"11","author":"Y. Matiasevitch","year":"1980","unstructured":"Y. Matiasevitch, Enumerable sets are diophantine, Sov. Math. Dokl. 11 (1980) 354?358.","journal-title":"Sov. Math. Dokl."},{"unstructured":"K. McAloon and C. Tretkoff, 2LP: A logic programming and linear programming system, Brooklyn College Computer Science Technical Report No. 1989-21.","key":"CR23"},{"key":"CR24","first-page":"158","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"M.S. Paterson and M.N. Wegman, Linear unification, J.CSS 16 (1978) 158?167.","journal-title":"J.CSS"},{"doi-asserted-by":"crossref","unstructured":"J. Renegar, A faster PSPACE algorithm for deciding the Existential Theory of the Reals,IEEE Symp. on Foundations of Computer Science '88.","key":"CR25","DOI":"10.1109\/SFCS.1988.21945"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/S0747-7171(89)80063-X","volume":"8","author":"K. Sakai","year":"1989","unstructured":"K. Sakai, and A. Aiba, CAL: Theoretical background of Constraint Logic Programming and its applications, J. Symbolic Comput. 8 (1989) 589?604.","journal-title":"J. Symbolic Comput."},{"unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, 1986).","key":"CR27"},{"unstructured":"J. Schwartz, J. Hopcroft and M. Sharir,Planning, Geometry and Complexity of Robot Motion Planning (Albex, 1987).","key":"CR28"},{"doi-asserted-by":"crossref","unstructured":"E. Shapiro, Alternation and the computational complexity of logic programs, J. Logic Progr. (1984) 19?33.","key":"CR29","DOI":"10.1016\/0743-1066(84)90021-9"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01543475.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01543475\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01543475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T20:25:59Z","timestamp":1735676759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01543475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":29,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01543475"],"URL":"https:\/\/doi.org\/10.1007\/bf01543475","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}