{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:31Z","timestamp":1725664231633},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:14:45Z","timestamp":1330280085000},"page":"345-361","source":"Crossref","is-referenced-by-count":2,"title":["Guarded constructive disjunction: Angel or demon?"],"prefix":"10.1007","author":[{"given":"Christian","family":"Codognet","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Codognet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","volume-title":"AKL(FD): finite domain constraints in AKL","author":"B. Carlson","year":"1994","unstructured":"B. Carlson, S. Haridi and S. Janson. AKL(FD): finite domain constraints in AKL. In International Logic Programming Symposium, Ithaca, USA, MIT Press 1994."},{"key":"21_CR2","volume-title":"proc. ICLP 91","author":"M. Codish","year":"1991","unstructured":"M. Codish, M. Falaschi and K. Marriott. Suspension Analyses for Concurrent Logic Programs. In proc. ICLP 91, Paris, France, MIT Press 1991."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"M. Codish, M. Falaschi, K. Marriott and W. Winsborough. Efficient Analysis of Concurrent Constraint Logic Programs. In proc. ICALP 93, Springer Verlag 1993.","DOI":"10.1007\/3-540-56939-1_108"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"C. Codognet and P. Codognet. A generalized semantics for concurrent constraint languages and their abstract interpretation. In: Constraint Processing, M. Meyer (Ed.), LNCS 923, Springer Verlag, 1995.","DOI":"10.1007\/3-540-59479-5_17"},{"key":"21_CR5","unstructured":"C. Codognet and P. Codognet. Abduction and Concurrent Logic Languages. In: proceedings of ECAI'94, European Conference on Artificial Intelligence, Amsterdam, Netherlands, August 1994."},{"key":"21_CR6","volume-title":"Abstract Interpretation for Concurrent Logic Languages","author":"C. Codognet","year":"1990","unstructured":"C. Codognet, P. Codognet and M-M. Corsini. Abstract Interpretation for Concurrent Logic Languages. In proc. North American Conference on Logic Programming, Austin, Texas, MIT Press 1990."},{"key":"21_CR7","unstructured":"P. Codognet and G. Fil\u00e9. Computation, abstractions and Constraints in Logic Programs. In proc. IEEE International Conference on Computer Languages, IEEE Press 1992."},{"key":"21_CR8","volume-title":"Prop revisited: propositional formulas as abstract domain for groundness analysis","author":"A. Cortesi","year":"1991","unstructured":"A. Cortesi, G. Fil\u00e9 and W. Winsborough. Prop revisited: propositional formulas as abstract domain for groundness analysis. In proc. LICS 91, IEEE symposium on Logic In Computer Science, Amsterdam, IEEE Press 1991."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming 13(2), 1992.","DOI":"10.1016\/0743-1066(92)90030-7"},{"key":"21_CR10","volume-title":"A minimal extension of the WAM for clp(FD)","author":"D. Diaz","year":"1993","unstructured":"D. Diaz and P. Codognet. A minimal extension of the WAM for clp(FD). In proc. ICLP'93, 10th International Conference on Logic Programming, Budapest, Hungary, MIT Press 1993."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM 21 (11), 1975.","DOI":"10.1145\/360933.360975"},{"key":"21_CR12","unstructured":"M. Falaschi, M. Gabbrielli, K. Marriott and C. Palamidessi. Compositional Analysis for Concurrent Constraint Programming. In proc. LICS 93, IEEE Press 1993."},{"key":"21_CR13","unstructured":"M. Falaschi, M. Gabbrielli, K. Marriott and C. Palamidessi. Confluence and CC programming. In proc. GULP+PRODE 94, Peniscola, Spain, 1994."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J-L. Lassez. Constraint Logic Programming. Research Report, University of Melbourne, June 1986. Short version in proc. 14th ACM conference on Principles Of Programming Languages, POPL'87, ACM Press 1987.","DOI":"10.1145\/41625.41635"},{"key":"21_CR15","unstructured":"R. Jagadeesan, V. Saraswat and V. Shanbhogue. Angelic non-determinism in concurrent constraint programming. Technical Report, Xerox PARC, 1991."},{"key":"21_CR16","unstructured":"J. Jourdan and T. Sola. The Versatility of Handling Disjunctions as Constraints. in proc. PLILP'93, Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, Springer Verlag."},{"key":"21_CR17","volume-title":"A generic abstract interpretation algorithm and its complexity analysis","author":"B. Charlier Le","year":"1991","unstructured":"B. Le Charlier, K. Musumbu and P. Van Hentenryck. A generic abstract interpretation algorithm and its complexity analysis. In 8th International Conference on Logic Programming, Paris, MIT Press 1991."},{"key":"21_CR18","volume-title":"Reexecution in Abstract Interpretation of Prolog","author":"B. Charlier Le","year":"1992","unstructured":"B. Le Charlier and P. Van Hentenryck. Reexecution in Abstract Interpretation of Prolog. In proc. Joint International Conference and Symposium on Logic Programming, Washington, MIT Press 1992."},{"key":"21_CR19","volume-title":"proc. FGCS 92","author":"T. Provost Le","year":"1992","unstructured":"T. Le Provost and M. Wallace. Domain Independent Propagation. In proc. FGCS 92, Tokyo, Japan, ICOT Press 1992."},{"key":"21_CR20","unstructured":"A. V. Mantsivoda. Disjunctive Constraints and Finite Domains. Technical Report 25-07\/93, Irkutsk State University, CEI, 1993."},{"key":"21_CR21","volume-title":"Symbolical construction of truth value domain for logic programs","author":"S. Morishita","year":"1987","unstructured":"S. Morishita, M. Numao and S. Hirose. Symbolical construction of truth value domain for logic programs. In proceedings of the 4th International Conference on Logic Programming, Sidney, Australia, MIT Press 1987."},{"key":"21_CR22","unstructured":"G. Plotkin. Domains. University of Edinburgh, 1983."},{"key":"21_CR23","unstructured":"V. A. Saraswat. Concurrent Constraint Programming Languages. Research Report CMU-CS-89-108, Carnegie Mellon University, 1989. Revised version MIT Press 93."},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat and M. Rinard. Concurrent Constraint Programming. In Proceedings of Seventeenth ACM Symposium on Principles of Programming Languages, San Francisco, CA, January 1990.","DOI":"10.1145\/96709.96733"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic Foundations of Concurrent Constraint Programming. In Proceedings of Ninth ACM Symposium on Principles of Programming Languages, Orlando, FL, January 1991.","DOI":"10.1145\/99583.99627"},{"key":"21_CR26","unstructured":"V. Saraswat. The Category of Constraint Systems is Cartesian-Closed. In proc. LICS'92, Logic In Computer Science, IEEE Press 1992."},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","volume":"34","author":"T. Sato","year":"1984","unstructured":"T. Sato and H. Tamaki. Enumeration of success patterns in logic programs. Theoritical Computer Science, vol. 34:227\u2013240, 1984.","journal-title":"Theoritical Computer Science"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"D. S. Scott Domains for denotational semantics. In proc. ICALP'82, International Colloquium on Automata, Languages and Programming, Springer Verlag 1982.","DOI":"10.1007\/BFb0012801"},{"key":"21_CR29","unstructured":"P. Struss and O. Dressler. Physical negation \u2014 integrating fault models into the General Diagnostic Engine. In proceedings of IJCAI 89, Detroit, 1989."},{"key":"21_CR30","unstructured":"P. Van Hentenryck, V. Saraswat and Y. Deville. Constraint processing in cc(FD). Research Report, Brown University, 1991."},{"key":"21_CR31","volume-title":"proceedings of PLILP 94","author":"E. Zaffanella","year":"1994","unstructured":"E. Zaffanella, G. Levi and R. Giacobazzi. Abstracting Synchronization in Concurrent Constraint Programming. In proceedings of PLILP 94, Madrid, LNCS 844, Springer Verlag 1994."},{"key":"21_CR32","unstructured":"E. Zaffanella. Domain Independent Ask Approximation in CCP. This volume."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:55Z","timestamp":1605646675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}