{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:54Z","timestamp":1725664974323},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617327"},{"type":"electronic","value":"9783540707400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61732-9_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:16:49Z","timestamp":1330276609000},"page":"320-338","source":"Crossref","is-referenced-by-count":1,"title":["On theorem-proving in Horn theories with built-in algebras"],"prefix":"10.1007","author":[{"given":"Nirina","family":"Andrianarivelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wadoud","family":"Bousdira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean -Marc","family":"Talbot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"20_CR1","unstructured":"Anantharaman, S., Andrianarivelo, N.: A semi-decision procedure in Horn Theories. technical report, Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans-Laboratoire de Recherche en Informatique d'Orsay, (1991)"},{"key":"20_CR2","unstructured":"Bousdira, W., Andrianarivelo, N.: A rewrite-based strategy for theorem proving in first order logic with equality and ordering constraints. technical report, Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans, (1994), 94-4"},{"key":"20_CR3","volume-title":"technical report Number 11","author":"J. Avenhaus","year":"1992","unstructured":"Avenhaus, J., Becker, K.: Conditional Rewriting modulo a Built-in Algebra. technical report Number 11, Universitat Kaiserslautern, West Germany, (1992)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Avenhaus, J., Becker, K.: Operational Specifications with Built-Ins. 7th Symposium on Theoretical Aspects of Computer Science, Caen, France, (1994), 263\u2013274","DOI":"10.1007\/3-540-57785-8_147"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Dershowitz, N.: Corrigendum to Termination of Rewriting. In Journal of Symbolic Computation, Vol. 4, 409\u2013410","DOI":"10.1016\/S0747-7171(87)80017-2"},{"key":"20_CR6","unstructured":"Dershowitz, N.: A maximal-literal strategy for Horn Clauses. 2nd International Workshop on Conditional Term Rewriting Systems, Montreal, Canada, (1990), 143\u2013154"},{"key":"20_CR7","first-page":"286","volume":"247","author":"H. Ganzinger","year":"1987","unstructured":"Ganzinger, H.: Ground Term Confluence in Parametric Conditional Equational Specifications. 4th annual Sympoisum on Theoretical Aspects of Computer Science, Passau, RFA, (1987), Vol. 247, 286\u2013298","journal-title":"4th annual Sympoisum on Theoretical Aspects of Computer Science, Passau, RFA"},{"issue":"Number.3","key":"20_CR8","first-page":"9","volume":"4","author":"C. Kirchner","year":"1990","unstructured":"Kirchner, C. and Kirchner, H. and Rusinowitch, M.: Deduction with Symbolic Constraints. Revue Fran\u00e7aise d'Intelligence Artificielle, (1990), Vol. 4, Number. 3, 9\u201352","journal-title":"Revue Fran\u00e7aise d'Intelligence Artificielle"},{"key":"20_CR9","first-page":"216","volume":"41","author":"E. Kounalis","year":"1990","unstructured":"Kounalis, E., Rusinowitch, M.: Mechanizing Inductive Reasoning. EATCS Bulletin, Vol. 41, (1990), 216\u2013226","journal-title":"EATCS Bulletin"},{"key":"20_CR10","volume-title":"PHD Thesis","author":"G. Smolka","year":"1989","unstructured":"Smolka, G.: Logic Programming over Polymorphically Order-Sorted Types. PHD Thesis, Universitat Kaiserslautern, West Germany, (1989)"},{"key":"20_CR11","unstructured":"Vorobyov, S.G.: Conditional Rewrite Rules Systems with Built-in Arithmetic and Induction. 3rd International Conference on Rewriting Techniques and Applications, Chapel Hill, North California, (1989), 492\u2013512"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Mathematical Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61732-9_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:09:52Z","timestamp":1605629392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61732-9_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617327","9783540707400"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61732-9_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}