{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:40:26Z","timestamp":1710283226692},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1007\/bf03037598","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:28:01Z","timestamp":1240543681000},"page":"209-255","source":"Crossref","is-referenced-by-count":7,"title":["Constructive negation and constraint logic programming with sets"],"prefix":"10.1007","volume":"19","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianfranco","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037598_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19\u201320","author":"K. R. Apt","year":"1994","unstructured":"Apt, K. R. and Bol, R., \u201cLogic Programming and Negation: a Survey,\u201dJournal of Logic Programming, 19\u201320, pp. 9\u201371, 1994.","journal-title":"Journal of Logic Programming"},{"key":"BF03037598_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S095679689700261X","volume":"7","author":"P. Arenas-S\u00e1nchez","year":"1997","unstructured":"Arenas-S\u00e1nchez, P. and Dovier, A., \u201cA Minimality Study for Set Unification,\u201dJournal of Functional and Logic Programming, 7, pp. 1\u201349, 1997.","journal-title":"Journal of Functional and Logic Programming"},{"issue":"1","key":"BF03037598_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(95)00146-8","volume":"27","author":"N. Arni","year":"1996","unstructured":"Arni, N., Greco, S. and Sacc\u00e0, D., \u201cMatching of Bounded Set Terms in the Logic Language LDL++,\u201dJournal of Logic Programming, 27, 1, pp. 73\u201387, 1996.","journal-title":"Journal of Logic Programming"},{"key":"BF03037598_CR4","unstructured":"Baader, F. and Schulz, K. U., Unification Theory, \u201cAutomated Deduction \u2014 A Basis for Applications,\u201d (Bibel, W. and Schmidt, P. H. eds),Foundations \u2014Calculi and Methods, 1, Applied Logic Series, 8, Vol. 8 of Applied Logic Kluwer Academic Publishers, pp. 225\u2013263. 1998."},{"key":"BF03037598_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0743-1066(90)90023-X","volume":"8","author":"R. Barbuti","year":"1990","unstructured":"Barbuti, R., Mancarella, P., Pedreschi, D. and Turini, F., \u201cA Transformation Approach to Negation in Logic Programming,\u201dJournal of Logic Programming, 8, pp. 201\u2013228, 1990.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"BF03037598_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0743-1066(91)90036-O","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Beeri, C., Naqvi, S., Shmueli, O. and Tsur., S., \u201cSet Constructors in a Logic Database Language,\u201dJournal of Logic Programming, 10, 3, pp. 181\u2013232, 1991.","journal-title":"Journal of Logic Programming"},{"key":"BF03037598_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.2307\/2268862","volume":"2","author":"P. Bernays","year":"1937","unstructured":"Bernays, P., \u201cA System of Axiomatic Set Theory Part I,\u201dJournal of Symbolic Logic, 2, pp. 65\u201377, 1937.","journal-title":"Journal of Symbolic Logic"},{"key":"BF03037598_CR8","first-page":"647","volume-title":"Proc. of Eleventh Int\u2019l Conf. on Logic Programming","author":"P. Bruscoli","year":"1994","unstructured":"Bruscoli, P., Dovier, A., Pontelli, E. and Rossi, G., \u201cCompiling Intensional Sets in CLP,\u201d inProc. of Eleventh Int\u2019l Conf. on Logic Programming (1994) (Van Hentenryck, P. ed.) The MIT Press, Cambridge, Mass., pp. 647\u2013661."},{"issue":"1\u20134","key":"BF03037598_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M., \u201cA Framework for the Abstract Interpretation of Logic Programs,\u201dJournal of Logic Programming, 10, 1\u20134, pp. 91\u2013124, 1991.","journal-title":"Journal of Logic Programming"},{"key":"BF03037598_CR10","series-title":"International Series of Monographs on Computer Science","volume-title":"Computable Set Theory","author":"D. Cantone","year":"1989","unstructured":"Cantone, D., Ferro, A. and Omodeo, E. G., \u201cComputable Set Theory,\u201dInternational Series of Monographs on Computer Science, 1, Clarendon Press, Oxford, 1989."},{"key":"BF03037598_CR11","first-page":"111","volume-title":"Proc. of Fifth International Conference and Symposium on Logic Programming","author":"D. Chan","year":"1988","unstructured":"Chan, D., \u201cConstructive Negation Based on the Completed Database,\u201d inProc. of Fifth International Conference and Symposium on Logic Programming (1988) (Kowalski, R. and Bowen, K., eds.) The MIT Press, Cambridge, Mass., pp. 111\u2013125."},{"key":"BF03037598_CR12","first-page":"477","volume-title":"Proc. of North-American Conference on Logic Programming","author":"D. Chan","year":"1989","unstructured":"Chan, D., \u201cAn Extension of Constructive Negation and its Application in Coroutining,\u201d inProc. of North-American Conference on Logic Programming (1989) (Lusk, E. and Overbeek, R., eds.) The MIT Press, Cambridge, Mass., pp. 477\u2013493."},{"key":"BF03037598_CR13","doi-asserted-by":"crossref","unstructured":"Clark, K. L., \u201cNegation as Failure,\u201dLogic and Databases (Gallaire, H. and Minker, J. eds.) Plenum Press, pp. 293\u2013321, 1978.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"BF03037598_CR14","doi-asserted-by":"crossref","unstructured":"Cortesi, A. and Fil\u00e8, G., \u201cAbstract Interpretation of Logic Programs: an Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis,\u201d inProc. of SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, ACM Press, pp. 52\u201361, 1991.","DOI":"10.1145\/115865.115872"},{"key":"BF03037598_CR15","doi-asserted-by":"crossref","unstructured":"Debray, S., Lopez-Garcia, P. and Hermenegildo, M., \u201cNon-failure Analysis for Logic Programs,\u201d inProc. of the International Conference on Logic Programming, MIT Press, pp. 48\u201362, 1997.","DOI":"10.7551\/mitpress\/4299.003.0010"},{"key":"BF03037598_CR16","first-page":"540","volume-title":"Proc. of Int\u2019l Logic Programming Symposium","author":"A. Dovier","year":"1993","unstructured":"Dovier, A. and Rossi, G., \u201cEmbedding Extensional Finite Sets in CLP,\u201d inProc. of Int\u2019l Logic Programming Symposium (Miller, D. ed.) The MIT Press Cambridge, Mass., pp. 540\u2013556, 1993."},{"issue":"1","key":"BF03037598_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(95)00147-6","volume":"28","author":"A. Dovier","year":"1996","unstructured":"Dovier, A., Omodeo, E. G., Pontelli, E. and Rossi, G., \u201c{log}: A Language for Programming in Logic with Finite Sets,\u201dJournal of Logic Programming, 28, 1, pp. 1\u201344, 1996.","journal-title":"Journal of Logic Programming"},{"issue":"2\/3","key":"BF03037598_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-36235","volume":"36","author":"A. Dovier","year":"1998","unstructured":"Dovier, A., Policriti, A. and Rossi, G., \u201cA Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms,\u201dFundamenta Informaticae, 36, 2\/3, pp. 201\u2013234, 1998.","journal-title":"Fundamenta Informaticae"},{"key":"BF03037598_CR19","unstructured":"Dovier, A., Pontelli, E. and Rossi, G., \u201cA Necessary Condition for Constructive Negation in Constraint Logic Programming,\u201d To appear inInformation Processing Letters."},{"issue":"1","key":"BF03037598_CR20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01185404","volume":"32","author":"W. Drabent","year":"1995","unstructured":"Drabent, W., \u201cWhat is Failure? An Approach to Constructive Negation,\u201dActa Informatica, 32, 1, pp. 27\u201329, 1995.","journal-title":"Acta Informatica"},{"key":"BF03037598_CR21","series-title":"Constraint Programming: Basic and Trends Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-59155-9_5","volume-title":"Constructive Negation by Pruning and Optimization Higher-order Predicates for clp and cc Languages","author":"F. Fages","year":"1995","unstructured":"Fages, F., \u201cConstructive Negation by Pruning and Optimization Higher-order Predicates for clp and cc Languages,\u201dConstraint Programming: Basic and Trends Lecture Notes in Computer Science, 910, Springer-Verlag, Berlin, pp. 68\u201389, 1995."},{"key":"BF03037598_CR22","doi-asserted-by":"crossref","unstructured":"Jaffar, J. and Lassez, J.-L., \u201cConstraint Logic Programming,\u201d Tech. rep., Department of Computer Science, Monash University, June 1986.","DOI":"10.1145\/41625.41635"},{"issue":"20","key":"BF03037598_CR23","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J. and Maher, M. J., \u201cConstraint Logic Programming: A Survey,\u201dThe Journal of Logic Programming, 19, 20, pp. 503\u2013581, 1994.","journal-title":"The Journal of Logic Programming"},{"key":"BF03037598_CR24","doi-asserted-by":"crossref","unstructured":"Lloyd, J.,Foundations of Logic Programming, Springer Verlag, 1986.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"BF03037598_CR25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K., \u201cNegation in Logic Programming,\u201dJournal of Logic Programming, 4, pp. 289\u2013308, 1987.","journal-title":"Journal of Logic Programming"},{"key":"BF03037598_CR26","doi-asserted-by":"crossref","unstructured":"Lassez, J. L., Maher, M. J., and Marriot, K., \u201cUnification Revisited,\u201dFoundations of Deductive Databases and Logic Programming (Minker, J. ed.), pp. 587\u2013625, Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"BF03037598_CR27","doi-asserted-by":"crossref","unstructured":"Maher, M. J., \u201cComplete Axiomatizations of the Algebras of Finite, Rational, and Infinite Trees,\u201d inProc. of Third Symposium Logic in Computer Science, pp. 349\u2013357, 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"BF03037598_CR28","unstructured":"Mal\u2019cev, A., \u201cAxiomatizable Classes of Locally Free Algebras of Various Types,\u201dThe Metamathematics of Algebraic Systems, North Holland,23, 1971."},{"key":"BF03037598_CR29","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A. and Montanari, U., \u201cAn Efficient Unification Algorithm,\u201dACM Transactions on Programming Languages and Systems, 4, pp. 258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF03037598_CR30","series-title":"Lecture Notes in Computer Science","first-page":"124","volume-title":"Proc. of International Workshop on Practical Aspects of Declarative Languages","author":"J. J. Moreno-Navarro","year":"2000","unstructured":"Moreno-Navarro, J. J. and Mu\u00f1oz-Hern\u00e1ndez, S., \u201cHow to Incorporate Negation in a Prolog Compiler,\u201d inProc. of International Workshop on Practical Aspects of Declarative Languages (Pontelli, E. and Santos Costa, V., eds.) ofLecture Notes in Computer Science, 1753, Springer-Verlag, Berlin, pp. 124\u2013139, 2000."},{"key":"BF03037598_CR31","unstructured":"Muthukumar, K. and Hermenegildo, M., \u201cCombined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation,\u201d inProc. of International Conference on Logic Programming, MIT Press, pp. 49\u201363, 1991."},{"key":"BF03037598_CR32","unstructured":"Niemela, I., \u201cLogic Programs with Stable Model Semantics as a Constraint Programming Paradigm,\u201d to appear inAnnals of Mathematics and AI."},{"issue":"4","key":"BF03037598_CR33","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1145\/32204.32219","volume":"12","author":"G. \u00d6zsoyoglu","year":"1987","unstructured":"\u00d6zsoyoglu, G., \u00d6zsoyoglu, Z. and Matos, V., \u201cExtending Relational Algebra and Relational Calculus with Set Valued Attributes and Aggregate Functions,\u201dTransactions on Database Systems, 12, 4, pp. 566\u2013592, 1987.","journal-title":"Transactions on Database Systems"},{"key":"BF03037598_CR34","unstructured":"Przymusinski, T., \u201cOn Constructive Negation in Logic Programming,\u201d inProc. of North American Conference on Logic Programming, MIT Press, 1990."},{"key":"BF03037598_CR35","doi-asserted-by":"crossref","unstructured":"Shepherdson, J. C., \u201cNegation in Logic Programming,\u201dFoundations of Deductive Databases and Logic Programming (Miker, J. ed.) Morgan Kaufmann, pp. 19\u201388, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"BF03037598_CR36","doi-asserted-by":"crossref","unstructured":"Siekmann, J. H., \u201cUnification Theory,\u201dUnification (Kirchner, C. ed.) Academic Press, 1990.","DOI":"10.1016\/0167-9236(90)90027-O"},{"key":"BF03037598_CR37","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1006\/inco.1995.1048","volume":"1","author":"P. J. Stuckey","year":"1995","unstructured":"Stuckey, P. J., \u201cNegation and Constraint Logic Programming,\u201dInformation and Computation, 1, pp. 12\u201333, 1995.","journal-title":"Information and Computation"},{"key":"BF03037598_CR38","unstructured":"Vaught, R. L., \u201cOn a Theorem of Cobham Concerning Undecidable Theories,\u201d inProc. of the 1960 International Congress, Stanford University Press (Nagel, E. Suppes, P. and Tarski, A. eds.), pp. 14\u201325, 1962."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037598.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037598\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:03:53Z","timestamp":1710281033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["BF03037598"],"URL":"https:\/\/doi.org\/10.1007\/bf03037598","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}