{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:16:29Z","timestamp":1770272189517,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642287282","type":"print"},{"value":"9783642287299","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_11","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T16:47:40Z","timestamp":1332434860000},"page":"165-179","source":"Crossref","is-referenced-by-count":4,"title":["Extending ${\\cal H}_1$ -Clauses with Path Disequalities"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Seidl","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Reu\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/1324249.1324261","volume-title":"Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2007","author":"A. Baskar","year":"2007","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: Knowledge-based modelling of voting protocols. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2007, pp. 62\u201371. ACM, New York (2007)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-57785-8_138","volume-title":"STACS 94","author":"H. Comon","year":"1994","unstructured":"Comon, H., Jacquemard, F.: Ground Reducibility and Automata with Disequality Constraints. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 151\u2013162. Springer, Heidelberg (1994)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/LICS.1997.614922","volume-title":"LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science","author":"H. Comon","year":"1997","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility is exptime-complete. In: LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pp. 26\u201334. IEEE Computer Society, Washington, DC, USA (1997)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-57220-1_66","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"A. Fujioka","year":"1993","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 244\u2013251. Springer, Heidelberg (1993)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Godoy, G., Gim\u00e9nez, O., Ramos, L., \u00c0lvarez, C.: The hom problem is decidable. In: STOC, pp. 485\u2013494 (2010)","DOI":"10.1145\/1806689.1806757"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ipl.2005.04.007","volume":"95","author":"J. Goubault-Larrecq","year":"2005","unstructured":"Goubault-Larrecq, J.: Deciding H1 by resolution. Information Processing Letters\u00a095(3), 401\u2013408 (2005)","journal-title":"Information Processing Letters"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-30579-8_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J. Goubault-Larrecq","year":"2005","unstructured":"Goubault-Larrecq, J., Parrennes, F.: Cryptographic Protocol Analysis on Real C Code. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 363\u2013379. Springer, Heidelberg (2005)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45789-5_5","volume-title":"Static Analysis","author":"F. Nielson","year":"2002","unstructured":"Nielson, F., Nielson, H.R., Seidl, H.: Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 20\u201335. Springer, Heidelberg (2002)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-642-16242-8_41","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Reu\u00df","year":"2010","unstructured":"Reu\u00df, A., Seidl, H.: Bottom-Up Tree Automata with Term Constraints. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 581\u2013593. Springer, Heidelberg (2010)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/3-540-48168-0_34","volume-title":"Computer Science Logic","author":"H. Seidl","year":"1999","unstructured":"Seidl, H., Neumann, A.: On Guarding Nested Fixpoints. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 484\u2013498. Springer, Heidelberg (1999)"},{"issue":"20","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.ipl.2011.07.011","volume":"111","author":"H. Seidl","year":"2011","unstructured":"Seidl, H., Reu\u00df, A.: Extending H1-clauses with disequalities. Information Processing Letters\u00a0111(20), 1007\u20131013 (2011)","journal-title":"Information Processing Letters"},{"key":"11_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-48660-7_29","volume-title":"Automated Deduction - CADE-16","author":"C. Weidenbach","year":"1999","unstructured":"Weidenbach, C.: Towards an Automatic Analysis of Security Protocols in First-Order Logic. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 314\u2013328. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:07:25Z","timestamp":1620112045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}