{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:20:48Z","timestamp":1743150048516,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142024"},{"type":"electronic","value":"9783642142031"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14203-1_26","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T13:10:58Z","timestamp":1278940258000},"page":"309-315","source":"Crossref","is-referenced-by-count":4,"title":["RegSTAB: A SAT Solver for Propositional Schemata"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Aravantinos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Caferra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Peltier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: A comparative survey. ACM Comput. Surv.\u00a038(4) (2006)","DOI":"10.1145\/1177352.1177354"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-02716-1_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"V. Aravantinos","year":"2009","unstructured":"Aravantinos, V., Caferra, R., Peltier, N.: A schemata calculus for propositional logic. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 32\u201346. Springer, Heidelberg (2009)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"LATA 2010 (Language, Automata Theory and Applications)","author":"V. Aravantinos","year":"2010","unstructured":"Aravantinos, V., Caferra, R., Peltier, N.: Complexity of the satisfiability problem for a class of propositional schemata. In: LATA 2010 (Language, Automata Theory and Applications). LNCS. Springer, Heidelberg (2010)"},{"key":"26_CR4","series-title":"LNAI","first-page":"293","volume-title":"IJCAR 2010","author":"V. Aravantinos","year":"2010","unstructured":"Aravantinos, V., Caferra, R., Peltier, N.: A Decidable Class of Nested Iterated Schemata. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS (LNAI), vol.\u00a06173, pp. 293\u2013308. Springer, Heidelberg (2010)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-45206-5_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M. Giese","year":"2003","unstructured":"Giese, M.: Simplification rules for constrained formula tableaux. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol.\u00a02796, pp. 65\u201380. Springer, Heidelberg (2003)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1093\/logcom\/3.1.3","volume":"3","author":"R. Caferra","year":"1993","unstructured":"Caferra, R., Zabel, N.: Building models by using tableaux extended by equational problems. Journal of Logic and Computation\u00a03, 3\u201325 (1993)","journal-title":"Journal of Logic and Computation"},{"issue":"9","key":"26_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. ACM Commun.\u00a03(9), 490\u2013499 (1960)","journal-title":"ACM Commun."},{"key":"26_CR8","unstructured":"Aravantinos, V., Caferra, R., Peltier, N.: A DPLL proof procedure for propositional iterated schemata. In: Workshop \u201cStructures and Deduction 2009\u201d (ESSLI), pp. 24\u201338 (2009)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14203-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T02:12:54Z","timestamp":1635214374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14203-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142024","9783642142031"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14203-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}