{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:37Z","timestamp":1725456337593},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029955","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:24:59Z","timestamp":1133400299000},"page":"117-128","source":"Crossref","is-referenced-by-count":0,"title":["The expressiveness of Datalog cicuits (DAC)"],"prefix":"10.1007","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ir\u00e8ne","family":"Guessarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"12_CR1","unstructured":"S. Abiteboul, R. Hull, V. Vianu, Foundations of databases, Addison-Wesley (1995)."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/74074.74077","volume":"20","author":"S. Abiteboul","year":"1989","unstructured":"S. Abiteboul, P. Kanellakis, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17\u201323.","journal-title":"SIGACT News"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jcss.1995.1060","volume":"51","author":"F. Afrati","year":"1995","unstructured":"F. Afrati, S. Cosmadakis, M. Yannakakis, On Datalog vs. polynomial time, J. Comput. Syst. Sc. 51 (1995), 177\u2013196.","journal-title":"J. Comput. Syst. Sc."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"J. Barwise, The Syntax and Semantics of Infinitary Languages, Springer-Verlag (1968).","DOI":"10.1007\/BFb0079679"},{"key":"12_CR5","first-page":"757","volume":"14","author":"R. Boppana","year":"1990","unstructured":"R. Boppana, M. Sipser, The complexity of finite functions, Handbook of Theoretical Computer Science 14 (1990), 757\u2013804.","journal-title":"Handbook of Theoretical Computer Science"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"H. Ebbinghaus, J. Flum, Finite Model Theory, Springer-Verlag (1995).","DOI":"10.1007\/3-540-28788-4"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:22:20Z","timestamp":1586578940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0029955","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}