{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:38Z","timestamp":1725456158963},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600176"},{"type":"electronic","value":"9783540494041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022262","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:12:29Z","timestamp":1132639949000},"page":"264-278","source":"Crossref","is-referenced-by-count":0,"title":["Reasoning and rewriting with set-relations I: Ground completeness"],"prefix":"10.1007","author":[{"given":"Valentinas","family":"Kriau\u010diukas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Walicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(90)90139-9","volume":"74","author":"M. Bezem","year":"1990","unstructured":"M. Bezem. Completeness of Resolution Revisited. TCS, 74, pp.27\u2013237, (1990).","journal-title":"TCS"},{"key":"20_CR2","volume-title":"Technical Report MPI-I-91-208","author":"L. Bachmair","year":"1991","unstructured":"L. Bachmair, H. Ganzinger. Rewrite-Based Equational Theorem Proving with Selection and Simplification. Technical Report MPI-I-91-208, Max-Planck-Institut f. Informatik, Saarbr\u00fccken, (1991)."},{"key":"20_CR3","volume-title":"Technical Report MPI-I-93-249","author":"L. Bachmair","year":"1993","unstructured":"L. Bachmair, H. Ganzinger. Rewrite Techniques for Transitive Relations. Technical Report MPI-I-93-249, Max-Planck-Institut f. Informatik, Saarbr\u00fccken, (1993). [to appear in LICS'94]"},{"key":"20_CR4","first-page":"243","volume-title":"Handbook of theoretical computer science, vol. B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz, J.-P. Jouannaud. Rewrite systems. In: J. van Leeuwen (ed.) Handbook of theoretical computer science, vol. B, chap. 6, pp.243\u2013320. Amsterdam: Elsevier, (1990)."},{"issue":"8","key":"20_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz, Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22:8,pp.465\u2013476, (1979).","journal-title":"Communications of the ACM"},{"key":"20_CR6","first-page":"150","volume":"660","author":"A. Dovier","year":"1993","unstructured":"A. Dovier,E. Omodeo,E. Pontelli,G.-F. Rossi. Embedding finite sets in a logic programming language. LNAI, 660, pp.150\u2013167, Springer Verlag, (1993).","journal-title":"LNAI"},{"key":"20_CR7","first-page":"87","volume":"10","author":"W.H. Hesselink","year":"1988","unstructured":"W.H. Hesselink. A Mathematical Approach to Nondeterminism in Data Types. ACM To PLaS 10, pp.87\u2013117, (1988).","journal-title":"ACM To PLaS"},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(92)90026-Y","volume":"12","author":"H. Hussmann","year":"1992","unstructured":"H. Hussmann. Nondeterministic algebraic specifications and nonconfluent term rewriting. Journal of Logic Programming, 12, pp.237\u2013235, (1992).","journal-title":"Journal of Logic Programming"},{"key":"20_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6834-2","volume-title":"Nondeterminism in Algebraic Specifications and Algebraic Programs","author":"H. Hussmann","year":"1993","unstructured":"H. Hussmann. Nondeterminism in Algebraic Specifications and Algebraic Programs. Birkh\u00e4user Boston, (1993)."},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0743-1066(92)90005-N","volume":"12","author":"B. Jayaraman","year":"1992","unstructured":"B. Jayaraman. Implementation of Subset-Equational Programs. Journal of Logic Programming, 12:4, pp.299\u2013324, (1992).","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(86)90005-8","volume":"56","author":"S. Kaplan","year":"1988","unstructured":"S. Kaplan. Rewriting with a Nondeterministic Choice Operator. TCS, 56:1, pp.37\u201357, (1988).","journal-title":"TCS"},{"key":"20_CR12","unstructured":"V. Kriau\u010diukas, M. Walicki Reasoning and Rewriting with Set-Relations I: Ground-Completeness. Technical Report no.96, Dept. of Informatics, University of Bergen (1994)."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"J. Levy, J. Agusti. Bi-rewriting, a term rewriting technique for monotonic order relations. In RTA'93, LNCS, 690, pp.17\u201331. Springer-Verlag, (1993).","DOI":"10.1007\/3-540-56868-9_3"},{"issue":"1\/2","key":"20_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0747-7171(08)80130-7","volume":"11","author":"J. Pais","year":"1991","unstructured":"J. Pais, G.E. Peterson. Using Forcing to Prove Completeness of Resolution and Paramodulation. Journal of Symbolic Computation, 11:(1\/2), pp.3\u201319, (1991).","journal-title":"Journal of Symbolic Computation"},{"key":"20_CR15","volume-title":"Technical Report MPI-I-92-224","author":"R. Socher-Ambrosius","year":"1992","unstructured":"R. Socher-Ambrosius. Completeness of Resolution and Superposition Calculi. Technical Report MPI-I-92-224, Max-Planck-Institut f. Informatik, Saarbr\u00fccken, (1992)."},{"key":"20_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with sets, an introduction to SETL","author":"J. Schwartz","year":"1986","unstructured":"J. Schwartz, R. Dewar, E. Schonberg, E. Dubinsky. Programming with sets, an introduction to SETL. Springer Verlag, New York, (1986)."},{"key":"20_CR17","unstructured":"F. Stolzenburg. An Algorithm for General Set Unification. Workshop on Logic Programming with Sets, ICLP'93, (1993)."},{"key":"20_CR18","unstructured":"M. Walicki. Algebraic Specifications of Nondeterminism. Ph.D. thesis, Institute of Informatics, University of Bergen, (1993)."},{"key":"20_CR19","unstructured":"M. Walicki, S. Meldal. A Complete Calculus for Multialgebraic and Functional Semantics of Nondeterminism. [to appear in ACM ToPLaS, (1995).]"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"M. Walicki, S. Meldal. Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions, Recent Trends in Data Type Specification, LNCS, 906, (1995).","DOI":"10.1007\/BFb0014444"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:43:14Z","timestamp":1586572994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600176","9783540494041"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0022262","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}