{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:21Z","timestamp":1725663501025},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:07:25Z","timestamp":1330254445000},"page":"213-225","source":"Crossref","is-referenced-by-count":1,"title":["Semantics for positive\/negative conditional rewrite systems"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. R. Apt","year":"1988","unstructured":"K. R. Apt, H. Blair and A. Walker, Towards a Theory of Declarative Knowledge, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, 1988) pp. 89\u2013148."},{"key":"16_CR2","unstructured":"J. Avenhaus and K. Becker, Conditional rewriting modulo a built-in algebra, SEKI Report SR-92-11."},{"key":"16_CR3","first-page":"1","volume-title":"Formal Techniques in Artificial Intelligence","author":"J. Avenhaus","year":"1990","unstructured":"J. Avenhaus and K. Madlener, Term rewriting and equational reasoning, in: R. B. Banerji, ed., Formal Techniques in Artificial Intelligence (North-Holland, Amsterdam, 1990) pp. 1\u201343."},{"key":"16_CR4","unstructured":"L. Bachmair and H. Ganzinger, Perfect model semantics for logic programs with equality, in: Proc. of 8th Int. Conf. on Logic Programming (MIT Press, 1991) pp. 645\u2013659."},{"key":"16_CR5","first-page":"241","volume-title":"Handbook of Theoretical Computer Science, Vol. B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J. P. Jouannaud, Rewriting systems, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) pp. 241\u2013320."},{"issue":"1\/2","key":"16_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and M. Okada, A rationale for conditional equational rewriting, Theoret. Comput. Science 75(1\/2) (1990) pp. 111\u2013137.","journal-title":"Theoret. Comput. Science"},{"key":"16_CR7","unstructured":"J.-P. Jouannaud and B. Waldmann, Reductive conditional term rewriting systems, in: Proc. Third IFIP Working Conference on Formal Description of Programming Concepts, Ebberup, Denmark (1986)."},{"issue":"3","key":"16_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(87)80010-X","volume":"4","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan, Simplifying conditional term rewriting systems: unification, termination and confluence, J. Symbolic Computation 4(3) (1987) pp. 295\u2013334.","journal-title":"J. Symbolic Computation"},{"key":"16_CR9","series-title":"LNCS 308","first-page":"129","volume-title":"Conditional Term Rewriting Systems","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan, Positive\/negative conditional rewriting, in: Conditional Term Rewriting Systems, LNCS 308 (Springer, Berlin, 1987) pp. 129\u2013143."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T. C. Przymusinski","year":"1988","unstructured":"T. C. Przymusinski, On the declarative semantics of deductive databases and logic programming, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, 1988) pp. 193\u2013216."},{"key":"16_CR11","unstructured":"C.-P. Wirth and B. Gramlich, A constructor-based approach for positive\/negative conditional equational specifications, this volume."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:20Z","timestamp":1619571020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}