{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:50Z","timestamp":1725467930253},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649939"},{"type":"electronic","value":"9783540497936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0057432","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:47:47Z","timestamp":1154306867000},"page":"28-38","source":"Crossref","is-referenced-by-count":1,"title":["Constraint solving in Logic Programming and in Automated Deduction: A comparison"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Armando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erica","family":"Melis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Ranise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"A. Armando and S. Ranise. From Integrated Reasoning Specialists to \u201cPlug-and-Play\u201d Reasoning Components. In Fourth International Conference on Artificial Intelligence and Symbolic Computation (AISC98). Plattsburgh, NY, USA. September 16\u201318, 1998.","key":"3_CR1","DOI":"10.1007\/BFb0055901"},{"doi-asserted-by":"crossref","unstructured":"A. Bouhoula and M. Rusinowitch. SPIKE: A system for automatic inductive proofs. Lecture Notes in Computer Science, 936, 1995.","key":"3_CR2","DOI":"10.1007\/3-540-60043-4_79"},{"key":"3_CR3","first-page":"83","volume":"11","author":"R. S. Boyer","year":"1988","unstructured":"R. S. Boyer and J S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic. Machine Intelligence (Logic and the Acquisition of Knowledge), 11:83\u2013124, 1988.","journal-title":"Machine Intelligence (Logic and the Acquisition of Knowledge)"},{"unstructured":"R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.","key":"3_CR4"},{"key":"3_CR5","first-page":"83","volume":"11","author":"R.S. Boyer","year":"1988","unstructured":"R.S. Boyer and J.S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic. Machine Intelligence, 11:83\u2013124, 1988.","journal-title":"Machine Intelligence"},{"key":"3_CR6","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewriting systems. In Handbook of Theoretical Computer Science, pages 243\u2013320. Elsevier Publishers, Amsterdam, 1990."},{"doi-asserted-by":"crossref","unstructured":"T. Fruehwirth. Constraint handling rules. Lecture Notes in Computer Science, 910, 1995.","key":"3_CR7","DOI":"10.1007\/3-540-59155-9_6"},{"issue":"1\u20132","key":"3_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0747-7171(08)80132-0","volume":"11","author":"H. Ganzinger","year":"1991","unstructured":"Harald Ganzinger. A completion procedure for conditional equations. Journal of Symbolic Computation, 11(1\u20132):51\u201381, January\u2013February 1991.","journal-title":"Journal of Symbolic Computation"},{"issue":"\/20","key":"3_CR9","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M.J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, (19\/20):503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. TOPLAS, 14(3):339\u2013395, July 1992.","journal-title":"TOPLAS"},{"issue":"2\u20133","key":"3_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"S. Kaplan. Conditional rewrite rules. Theoretical Computer Science, 33(2\u20133):175\u2013193, October 1984.","journal-title":"Theoretical Computer Science"},{"key":"3_CR12","first-page":"768","volume-title":"volume 310 of LNCS","author":"D. Kapur","year":"1988","unstructured":"Deepak Kapur and Hantao Zhang. RRL: A rewrite rule laboratory. In E. Lusk; R. Overbeek, editor, Proceedings on the 9th International Conference on Automated Deduction, volume 310 of LNCS, pages 768\u2013769, Berlin, May 1988. Springer."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-59155-9_8","volume":"910","author":"H. Kirchner","year":"1995","unstructured":"H. Kirchner. On the use of constraints in automated deduction. Lecture Notes in Computer Science, 910:128\u2013--, 1995.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.","key":"3_CR14","DOI":"10.1007\/978-3-642-96826-6"},{"doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Anuchitanukul, N. Bjorner, A. Browne, E. Chang, M. Colon, L. de Alfaro, H. Devarajan, H. Sipma, and T. Uribe. STeP: The Stanford temporal prover. Technical Report CS-TR-94-1518, Stanford University, June 1994.","key":"3_CR15","DOI":"10.21236\/ADA324036"},{"unstructured":"G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. Technical Report STAN-CS-78-652, Stanford Computer Science Department, April 1978.","key":"3_CR16"},{"unstructured":"Michael J. O'Donnell. Equational logic programming. In C. J. Hogger D. M. Gabbay and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, Logic Programming, chapter 3. Oxford University Press, 1995.","key":"3_CR17"},{"key":"3_CR18","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. A Wiley-Interscience publication. Wiley, Chichester, New York, 1986."},{"unstructured":"Cesare Tinelli and Mehdi Harandi. Constraint logic programming over unions of constraint theories. Journal of Logic and Functional Programming, 1998. (to appear).","key":"3_CR19"},{"key":"3_CR20","first-page":"46","volume-title":"volume 202 of LNCS","author":"H. Zhang","year":"1985","unstructured":"H. Zhang and J. L. Remy. Contextual rewriting. In Jean-Pierre Jouannaud, editor, Proceedings of the 1st International Conference on Rewriting Techniques and Applications, volume 202 of LNCS, pages 46\u201362, Dijon, France, May 1985. Springer."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence: Methodology, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0057432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:15:41Z","timestamp":1555748141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0057432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649939","9783540497936"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0057432","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}