{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:06Z","timestamp":1725664566356},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620648"},{"type":"electronic","value":"9783540496373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62064-8_34","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:33:33Z","timestamp":1330277613000},"page":"409-419","source":"Crossref","is-referenced-by-count":3,"title":["Merging relational database technology with constraint technology"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Voronkov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"34_CR1","unstructured":"S. Abiteboul, R. Hull, and V. Vianu. Foundation of Databases. Addison-Wesley Publishing Co., 1995."},{"issue":"3","key":"34_CR2","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1007\/BF01084392","volume":"22","author":"E. Dantsin","year":"1983","unstructured":"E. Dantsin. Two propositional proof systems based on the splitting method. Journal of Soviet Mathematics, 22(3):1293\u20131305, 1983.","journal-title":"Journal of Soviet Mathematics"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"P. Graf. Substitution tree indexing. In J. Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 117\u2013131, 1995.","DOI":"10.1007\/3-540-59200-8_52"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"P. Graf. Term Indexing, volume 1053 of Lecture Notes in Computer Science. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61040-5"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"E.L. Lusk. Controlling redundancy in large search spaces: Argonne-style theorem proving through the years. In A. Voronkov, editor, Logic Programming and Automated Reasoning. International Conference LPAR'92., volume 624 of Lecture Notes in Artificial Intelligence, pages 96\u2013106, St. Petersburg, Russia, July 1992.","DOI":"10.1007\/BFb0013052"},{"issue":"3","key":"34_CR6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0167-6423(83)90016-3","volume":"2","author":"G. Mints","year":"1982","unstructured":"G. Mints and E. Tyugu. Justification of the structural synthesis of programs. Science of Computer Programming, 2(3):215\u2013240, 1982.","journal-title":"Science of Computer Programming"},{"key":"34_CR7","unstructured":"E. Tyugu. Declarative programming in a type theory. In B. Moeller, editor, Constructing Programs from Specifications, pages 451\u2013472. North Holland, 1991."},{"key":"34_CR8","unstructured":"J.D. Ullman. Database and Knowledge-Base Systems, volume I. Computer Science Press, 1988."},{"key":"34_CR9","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, 1989."},{"issue":"1","key":"34_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"L. Vieille. Recursive query processing: the power of logic. Theoretical Computer Science, 69(1):1\u201353, 1989.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"34_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00881918","volume":"15","author":"A. Voronkov","year":"1995","unstructured":"A. Voronkov. The anatomy of Vampire: Implementing bottom-up procedures with code trees. Journal of Automated Reasoning, 15(2):237\u2013265, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"A. Voronkov. Merging relational database technology with the constraint technology. UPMAIL Technical Report, Uppsala University, Computing Science Department, 1996. To appear.","DOI":"10.1007\/3-540-62064-8_34"},{"key":"34_CR13","first-page":"3","volume-title":"Computational Logic. Essays in Honor of Alan Robinson","author":"L. Wos","year":"1991","unstructured":"Larry Wos, Ross Overbeek, and Ewing Lusk. Subsumption, a sometimes undervalued procedure. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. Essays in Honor of Alan Robinson., pages 3\u201340. The MIT Press, Cambridge, MA, 1991."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62064-8_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:11:51Z","timestamp":1605629511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62064-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620648","9783540496373"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-62064-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}