{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T05:10:05Z","timestamp":1741583405573,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":59,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642642494"},{"type":"electronic","value":"9783642600852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-642-60085-2_13","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:03:26Z","timestamp":1315479806000},"page":"313-331","source":"Crossref","is-referenced-by-count":3,"title":["Adding Constraints to Logic-based Formalisms"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Maher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19\/20","author":"KR Apt","year":"1994","unstructured":"K.R. Apt and R. N. Bol, Logic Programming and Negation: A Survey,Journal of Logic Programming, 19\/20,, 9\u201371, 1994.","journal-title":"Journal of Logic Programming"},{"key":"13_CR2","first-page":"322","volume-title":"Lecture Notes in Computer Science 893","author":"M Baudinet","year":"1995","unstructured":"M. Baudinet, J. Chomicki and P. Wolper, Constraint-Generating Dependencies, in G. Gottlob and M.Y. Vardi (Eds.),Database Theory - ICDT\u201995,Lecture Notes in Computer Science 893, Springer-Verlag, 322\u2013337, 1995."},{"key":"13_CR3","volume-title":"Advances in Logic Programming Theory","author":"FS Boer de","year":"1994","unstructured":"F.S. de Boer and C. Palamidessi, From Concurrent Logic Programming to Concurrent Constraint Programming, in:Advances in Logic Programming Theory, Oxford University Press, 1994"},{"key":"13_CR4","first-page":"235","volume-title":"A Resolution Principle for Constrained Logics","author":"H-J B\u00fcrckert","year":"1994","unstructured":"H-J. B\u00fcrckert,A Resolution Principle for Constrained Logics,Artificial Intelligence 66, 235\u2013271, 1994."},{"key":"13_CR5","first-page":"293","volume-title":"Logic and Databases","author":"KL Clark","year":"1978","unstructured":"K.L. Clark, Negation as Failure, in H. Gallaire and J. Minker (Eds.),Logic and Databases, Plenum Press, New York, 293\u2013322, 1978."},{"key":"13_CR6","first-page":"85","volume-title":"Equations and Inequations on Finite and Infinite Trees","author":"A Colmerauer","year":"1984","unstructured":"A. Colmerauer, Equations and Inequations on Finite and Infinite Trees,Proc. 2nd. Int. Conf. on Fifth Generation Computer Systems, Tokyo, 85\u201399, 1984."},{"key":"13_CR7","first-page":"682","volume-title":"A New Perspective on Integrating Functional and Logic Languages,Proc. Int. Conf. on Fifth Generation Computer Systems","author":"J Darlington","year":"1992","unstructured":"J. Darlington, Y. Guo, H. Pull, A New Perspective on Integrating Functional and Logic Languages,Proc. Int. Conf. on Fifth Generation Computer Systems, 682\u2013693, Ohmsha, Tokyo, 1992."},{"key":"13_CR8","first-page":"47","volume":"37","author":"J Dix","year":"1998","unstructured":"J. Dix, Stolzenburg, A Framework to Incorporate Non-Monotonic Reasoning into Constraint Logic Programming,Journal of Logic Programming 37, 47\u201376, 1998.","journal-title":"A Framework to Incorporate Non-Monotonic Reasoning into Constraint Logic Programming, Journal of Logic Programming"},{"key":"13_CR9","first-page":"113","volume-title":"Essays in Honor of Alan Robinson","author":"M Fitting","year":"1991","unstructured":"M. Fitting, Modal Logic Should Say More Than It Does, in: J-L. Lassez, G. Plotkin (Eds.),Computational Logic: Essays in Honor of Alan Robinson, MIT Press, 113\u2013135. 1991."},{"key":"13_CR10","unstructured":"M. Fitting, Basic Modal Logic, in:Handbook of Mathematical Logic and Logic Programming,D. Gabbay(Ed.), Oxford University Press."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T Fr\u00fchwirth","year":"1998","unstructured":"T. Fr\u00fchwirth, Theory and Practice of Constraint Handling Rules,Journal of Logic Programming 37, 95\u2013138, 1998.","journal-title":"Journal of Logic Programming"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Gelder van","year":"1991","unstructured":"A. van Gelder, K. Ross, J.S. Schlipf, Unfounded Sets and Weil-Founded Semantics for General Logic Programs,Journal of the ACM, 38, 620\u2013650, 1991.","journal-title":"Journal of the ACM"},{"key":"13_CR13","first-page":"1070","volume-title":"The Stable Model Semantics for Logic Programming","author":"M Gelfond","year":"1988","unstructured":"M. Gelfond, V. Lifschitz, The Stable Model Semantics for Logic Programming,Proc. 5th International Conference on Logic Programming, 1070\u20131080, 1988."},{"key":"13_CR14","volume-title":"Constraint Satisfaction in Logic Programming","author":"P Hentenryck van","year":"1989","unstructured":"P. van Hentenryck,Constraint Satisfaction in Logic Programming, MIT Press, 1989."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P Hentenryck Van","year":"1998","unstructured":"P. Van Hentenryck, V. Saraswat, Y. Deville, Design, Implementation and Evaluation of the Constraint Language cc(FD),Journal of Logic Programming 37, 139\u2013164, 1998.","journal-title":"Journal of Logic Programming"},{"key":"13_CR16","volume-title":"Ecrits Logiques de Jacques Herbrand","author":"J Herbrand","year":"1968","unstructured":"J. Herbrand, Recherches sur la Th\u00e9orie de la D\u00e9monstration, thesis, Universit\u00e9 de Paris, 1930. In:Ecrits Logiques de Jacques Herbrand, PUF, Paris, 1968."},{"key":"13_CR17","first-page":"355","volume-title":"Selected Research","author":"T Hickey","year":"1993","unstructured":"T. Hickey , Functional Constraints in CLP Languages, in:Constraint Logic Programming: Selected Research, F. Benhamou, A. Colmerauer (Eds.), MIT Press, 355\u2013381, 1993."},{"key":"13_CR18","unstructured":"ILOG, ILOG Solver 4.2 Reference Manual, 1998."},{"key":"13_CR19","first-page":"111","volume-title":"Constraint Logic Programming, Proc. 14th ACM Symposium on Principles of Programming Languages","author":"J Jaffar","year":"1987","unstructured":"J. Jaffar, J-L. Lassez, Constraint Logic Programming,Proc. 14th ACM Symposium on Principles of Programming Languages, 111\u2013119, 1987."},{"key":"13_CR20","first-page":"500","volume-title":"Completeness of the Negation as Failure Rule,Proc. IJCAI\u201383","author":"J Jaffar","year":"1983","unstructured":"J. Jaffar, J-L. Lassez, J.W. Lloyd, Completeness of the Negation as Failure Rule,Proc. IJCAI\u201383, 500\u2013506, 1983."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J Jaffar","year":"1994","unstructured":"J. Jaffar, M.J. Maher, Constraint Logic Programming: A Survey,Journal of Logic Programming 19\/20, 503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J Jaffar","year":"1998","unstructured":"J. Jaffar, M.J. Maher, K.G. Marriott, P.J. Stuckey, Semantics of Constraint Logic Programs,Journal of Logic Programming, 37, 1\u201346, 1998.","journal-title":"Journal of Logic Programming"},{"key":"13_CR23","first-page":"399","volume-title":"Integrating Abductive and Constraint Logic Programming, Proc. International Conference on Logic Programming","author":"AC Kakas","year":"1995","unstructured":"A. C. Kakas, A. Michael, Integrating Abductive and Constraint Logic Programming,Proc. International Conference on Logic Programming, 399\u2013413, MIT Press, 1995."},{"issue":"1","key":"13_CR24","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P Kanellakis","year":"1995","unstructured":"P. Kanellakis, G. Kuper, P. Revesz, Constraint Query Languages,Journal of Computer and System Sciences, 51(1), 26\u201352, 1995.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/42267.42273","volume":"35","author":"A Klug","year":"1988","unstructured":"A.Klug, On Conjunctive Queries Containing Inequalities,Journal of the ACM 35, 1, 146\u2013160, 1988.","journal-title":"Journal of the ACM"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K Kunen","year":"1987","unstructured":"K. Kunen, Negation in Logic Programming,Journal of Logic Programming, 4, 289\u2013308, 1987.","journal-title":"Journal of Logic Programming"},{"key":"13_CR27","first-page":"166","volume-title":"Aggregation in Constraint Databases, Proc. Workshop on Principles and Practice of Constraint Programming","author":"G Kuper","year":"1993","unstructured":"G. Kuper, Aggregation in Constraint Databases,Proc. Workshop on Principles and Practice of Constraint Programming, 166\u2013173, 1993."},{"key":"13_CR28","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J-L Lassez","year":"1988","unstructured":"J-L. Lassez, M. Maher, K.G. Marriott, Unification Revisited, in:Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 587\u2013625, 1988."},{"key":"13_CR29","first-page":"52","volume-title":"A Constraint Sequent Calculus, Proc. of 5th. Symp. on Logic in Computer Science","author":"J-L Lassez","year":"1990","unstructured":"J-L. Lassez, K. McAloon, A Constraint Sequent Calculus,Proc. of 5th. Symp. on Logic in Computer Science, 52\u201362, 1990."},{"key":"13_CR30","first-page":"1","volume-title":"A Canonical Form for Generalized Linear Constraints, Journal of Symbolic Computation 13","author":"J-L Lassez","year":"1992","unstructured":"J-L. Lassez, K. McAloon, A Canonical Form for Generalized Linear Constraints,Journal of Symbolic Computation 13, 1\u201324, 1992."},{"key":"13_CR31","first-page":"1248","volume-title":"Using Constraints to Model Disjunctions in Rule Based Programming, Proc. American National Conf. on Artificial Intelligence (AAAI)","author":"B Liu","year":"1996","unstructured":"B. Liu, J. Jaffar, Using Constraints to Model Disjunctions in Rule Based Programming,Proc. American National Conf. on Artificial Intelligence (AAAI), 1248\u20131255, 1996."},{"key":"13_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1987","unstructured":"J.W. Lloyd,Foundations of Logic Programming, Springer-Verlag, Second Edition, 1987."},{"key":"13_CR33","volume-title":"2LP: A Logic Programming and Linear Programming System","author":"K McAloon","year":"1989","unstructured":"K. McAloon, C. Tretkoff, 2LP: A Logic Programming and Linear Programming System, Brooklyn College Computer Science Technical Report No 1989\u201321, 1989."},{"key":"13_CR34","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"JL McCarthy","year":"1980","unstructured":"J.L. McCarthy, Circumscription - A Form of Non-Monotonic Reasoning,Artificial Intelligence, 13, 27\u201339, 1980.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"13_CR35","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A Mackworth","year":"1977","unstructured":"A. Mackworth, Consistency in Networks of Relations,Artificial Intelligence8(1), 99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"13_CR36","first-page":"858","volume-title":"Semantics for a Class of Committed-Choice Programs, Proc. 4th International Conference on Logic Programming","author":"MJ Maher","year":"1987","unstructured":"M.J. Maher, Logic Semantics for a Class of Committed-Choice Programs,Proc. 4th International Conference on Logic Programming, 858\u2013876, 1987."},{"key":"13_CR37","first-page":"348","volume-title":"Full version: IBM Research Report","author":"MJ Maher","year":"1988","unstructured":"M.J. Maher , Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees,Proc. 3rd. Symp. Logic in Computer Science, 348\u2013357, 1988. Full version: IBM Research Report, T.J. Watson Research Center."},{"key":"13_CR38","first-page":"737","volume-title":"A Logic Programming View of CLP, Proc. 10th International Conference on Logic Programming","author":"MJ Maher","year":"1993","unstructured":"M.J. Maher, A Logic Programming View of CLP,Proc. 10th International Conference on Logic Programming, 737\u2013753, 1993."},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0304-3975(96)00193-4","volume":"173","author":"MJ Maher","year":"1997","unstructured":"M.J. Maher, Constrained Dependencies,Theoretical Computer Science 173, 113\u2013149, 1997.","journal-title":"Theoretical Computer Science"},{"key":"13_CR40","first-page":"128","volume-title":"Chasing Constrained Tuple-Generating Dependencies","author":"M Maher","year":"1996","unstructured":"M. Maher, D. Srivastava, Chasing Constrained Tuple-Generating Dependencies,Proc. ACM Symposium on Principles of Database Systems, 128\u2013138, ACM Press, 1996."},{"key":"13_CR41","first-page":"262","volume-title":"The Metamathematics of Algebraic Systems: Collected Papers, 1936\u20131967","author":"A Mal\u2019cev","year":"1971","unstructured":"A. Mal\u2019cev , Axiomatizable Classes of Locally Free Algebras of Various Types, in:The Metamathematics of Algebraic Systems: Collected Papers, 1936\u20131967, Chapter 23, 262\u2013281, 1971."},{"key":"13_CR42","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"K Marriott","year":"1998","unstructured":"K. Marriott, P. Stuckey.Programming with Constraints: An Introduction, MIT Press, 1998."},{"key":"13_CR43","unstructured":"L. Naish,Negation and Control in PROLOG, Lecture Notes in Computer Science 238, Springer-Verlag, 1986."},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"D. Nute , Defeasible Logic, in:Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Oxford University Press, 1994, 353\u2013395.","DOI":"10.1093\/oso\/9780198537472.003.0007"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"M. Odersky, M. Sulzmann, M. Wehr, Type Inference with Constrained Types,Theory and Practice of Object Systems, to appear.","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4"},{"key":"13_CR46","unstructured":"J.-F. Puget, Constraint Programming,Proc. Joint Int. Conf. and Symp. on Logic Programming, 3, MIT Press, 1996."},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0743-1066(91)90026-L","volume":"11","author":"R Ramakrishnan","year":"1991","unstructured":"R. Ramakrishnan, Magic Templates: A Spellbinding Approach to Logic Programs,Journal of Logic Programming, 11, 189\u2013216, 1991.","journal-title":"Journal of Logic Programming"},{"key":"13_CR48","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R Reiter","year":"1980","unstructured":"R. Reiter, A Logic for Default Reasoning,Artificial Intelligence13, 81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"13_CR49","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle,Journal of the ACM 12(1), 23\u201341, 1965.","journal-title":"Journal of the ACM"},{"key":"13_CR50","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/72551.72555","volume":"21","author":"E Shapiro","year":"1989","unstructured":"E. Shapiro, The Family of Concurrent Logic Programming Languages,ACM Computing Surveys 21, 412\u2013510, 1989.","journal-title":"ACM Computing Surveys"},{"key":"13_CR51","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J Siekmann","year":"1989","unstructured":"J. Siekmann, Unification Theory,Journal of Symbolic Computation, 7, 207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR52","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0743-1066(93)90048-L","volume":"16","author":"D Srivastava","year":"1993","unstructured":"D. Srivastava, R. Ramakrishnan, Pushing Constraint Selections,Journal of Logic Programming, 16, 361\u2013414, 1993.","journal-title":"Journal of Logic Programming"},{"key":"13_CR53","first-page":"333","volume":"1","author":"M Stickel","year":"1984","unstructured":"M. Stickel, Automated Deduction by Theory Resolution,Journal of Automated Reasoning1, 333\u2013355, 1984.","journal-title":"Journal of Automated Reasoning"},{"issue":"1","key":"13_CR54","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1048","volume":"118","author":"P Stuckey","year":"1995","unstructured":"P. Stuckey, Negation and Constraint Logic Programming,Information and Computation, 118(1), 12\u201333, 1995.","journal-title":"Information and Computation"},{"key":"13_CR55","first-page":"423","volume-title":"Proc. Conf. on Programming Language Implementation and Logic Programming","author":"PJ Stuckey","year":"1996","unstructured":"P.J. Stuckey, V. Tam, Models for using Stochastic Constraint Solvers in Constraint Logic Programming,Proc. Conf. on Programming Language Implementation and Logic Programming, LNCS 1140, 423\u2013437, 1996."},{"key":"13_CR56","unstructured":"E. Tsang,Foundations of Constraint Satisfaction, Academic Press, 1993."},{"key":"13_CR57","doi-asserted-by":"crossref","unstructured":"K. Ueda, Guarded Horn Clauses,Proc. Japanese Logic Programming Conf., LNCS 221, 1985.","DOI":"10.1007\/3-540-16479-0_17"},{"key":"13_CR58","unstructured":"K. Ueda, Concurrent Logic\/Constraint Programming: The Next 10 Years, this volume."},{"key":"13_CR59","first-page":"263","volume-title":"A Unified Treatment of Resolution Strategies for Logic Programs, Proc. Second Int. Conf. on Logic Programming","author":"DA Wolfram","year":"1984","unstructured":"D.A. Wolfram, M.J. Maher, J.-L. Lassez, A Unified Treatment of Resolution Strategies for Logic Programs,Proc. Second Int. Conf. on Logic Programming, Uppsala, 263\u2013276, 1984."}],"container-title":["Artificial Intelligence","The Logic Programming Paradigm"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-60085-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T04:40:26Z","timestamp":1741581626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-60085-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783642642494","9783642600852"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-60085-2_13","relation":{},"ISSN":["1431-0066"],"issn-type":[{"type":"print","value":"1431-0066"}],"subject":[],"published":{"date-parts":[[1999]]}}}