{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T05:27:39Z","timestamp":1739510859858,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_28","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"334-345","source":"Crossref","is-referenced-by-count":0,"title":["Destructive Rule-Based Properties and First-Order Logic"],"prefix":"10.1007","author":[{"given":"David","family":"Duris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-63246-8_2","volume-title":"Structures in Logic and Computer Science","author":"N. Alechina","year":"1997","unstructured":"Alechina, N., Gurevich, Y.: Syntax vs Semantics on Finite Structures. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 14\u201333. Springer, Heidelberg (1997)"},{"key":"28_CR2","unstructured":"Duris, D.: Some Characterizations of \u03b3 and \u03b2-Acyclicity of Hypergraphs (2008), http:\/\/hal.archives-ouvertes.fr\/hal-00360321\/fr\/"},{"key":"28_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2355-7","volume-title":"Mathematical Logic","author":"H.-D. Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1994)"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. J. of the ACM\u00a030(3), 514\u2013550 (1983)","journal-title":"J. of the ACM"},{"key":"28_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.\u00a0Freeman, New York (1979)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Kreutzer, S.: Will Deflation Lead to Depletion? on Non-Monotone Fixed Point Inductions. In: Proceedings of the 18th\u00a0Annual IEEE Symposium on Logic in Computer Science (LICS 2003), pp. 158\u2013167 (2003)","DOI":"10.1109\/LICS.2003.1210055"},{"key":"28_CR7","first-page":"664","volume":"51","author":"G. Gottlob","year":"2000","unstructured":"Gottlob, G., Kolaitis, G., Schwentick, T.: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. J. of the ACM\u00a051, 664\u2013674 (2000)","journal-title":"J. of the ACM"},{"key":"28_CR8","volume-title":"Graphs, Networks and Algorithms","author":"D. Jungnickel","year":"2005","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms. Springer, Heidelberg (2005)"},{"key":"28_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Nagl, M.: Graph-Grammatiken: Theorie, Anwendungen, Implementierung. Vieweg (1979)","DOI":"10.1007\/978-3-663-01443-0"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A Simplified NP-Complete Satisfiability Problem. Discrete Applied Mathematics\u00a08(1), 85\u201390 (1984)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:27:27Z","timestamp":1739467647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}