{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:52Z","timestamp":1725470752505},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540396253"},{"type":"electronic","value":"9783540396277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11853886_15","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T12:40:30Z","timestamp":1158151230000},"page":"164-176","source":"Crossref","is-referenced-by-count":1,"title":["Model Representation over Finite and Infinite Signatures"],"prefix":"10.1007","author":[{"given":"Christian G.","family":"Ferm\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-45085-6_32","volume-title":"Automated Deduction \u2013 CADE-19","author":"P. Baumgartner","year":"2003","unstructured":"Baumgartner, P., Tinelli, C.: The model evolution calculus. In: Baader, F. (ed.) CADE 2003. LNCS, vol.\u00a02741, pp. 350\u2013364. Springer, Heidelberg (2003)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11532231_29","volume-title":"Automated Deduction \u2013 CADE-20","author":"P. Baumgartner","year":"2005","unstructured":"Baumgartner, P., Tinelli, C.: The model evolution calculus with equality. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol.\u00a03632, pp. 392\u2013408. Springer, Heidelberg (2005)"},{"key":"15_CR3","unstructured":"Baumgartner, P., Fuchs, A., Tinelli, C.: Lemma Learning in the Model Evolution Calculus (submitted)"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1994.1056","volume":"112","author":"H. Comon","year":"1994","unstructured":"Comon, H., Delor, C.: Equational formulae with membership constraints. Information and Computation\u00a0112(2), 167\u2013216 (1994)","journal-title":"Information and Computation"},{"key":"15_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BFb0018439","volume-title":"Logics in AI","author":"R. Caferra","year":"1991","unstructured":"Caferra, R., Zabel, N.: Extending resolution for model construction. In: van Eijck, J. (ed.) JELIA 1990. LNCS (LNAI), vol.\u00a0478, pp. 153\u2013169. Springer, Heidelberg (1991)"},{"key":"15_CR6","series-title":"Applied Logic Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-2653-9","volume-title":"Automated Model Building","author":"R. Caferra","year":"2004","unstructured":"Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building. Applied Logic Series, vol.\u00a031. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/11546207_42","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2005","unstructured":"Eiter, T., Faber, W., Traxler, P.: Testing strong equivalence of datalog programs - implementation and examples. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol.\u00a03662, pp. 437\u2013441. Springer, Heidelberg (2005)"},{"key":"15_CR8","unstructured":"Eiter, T., Fink, M., Tompits, H., Traxler, P., Woltran, S.: Replacements in non-ground answer set programming. In: Proc. of WLP 2006, pp. 145\u2013153 (2006)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-56992-8_10","volume-title":"Computer Science Logic","author":"C.G. Ferm\u00fcller","year":"1993","unstructured":"Ferm\u00fcller, C.G., Leitsch, A.: Model building by resolution. In: Martini, S., B\u00f6rger, E., Kleine B\u00fcning, H., J\u00e4ger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol.\u00a0702, pp. 134\u2013148. Springer, Heidelberg (1993)"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1093\/logcom\/6.2.173","volume":"6","author":"C.G. Ferm\u00fcller","year":"1996","unstructured":"Ferm\u00fcller, C.G., Leitsch, A.: Hyperresolution and automated model building. Journal of Logic and Computation\u00a06(2), 173\u2013203 (1996)","journal-title":"Journal of Logic and Computation"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11532231_30","volume-title":"Automated Deduction \u2013 CADE-20","author":"C. Ferm\u00fcller","year":"2005","unstructured":"Ferm\u00fcller, C., Pichler, R.: Model representation via contexts and implicit generalizations. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol.\u00a03632, pp. 409\u2013423. Springer, Heidelberg (2005)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.2000.2915","volume":"165","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Pichler, R.: Working with ARMs: Complexity results on atomic representations of Herbrand models. Information and Computation\u00a0165, 183\u2013207 (2001)","journal-title":"Information and Computation"},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01893885","volume":"28","author":"D. Kapur","year":"1991","unstructured":"Kapur, D., Narendran, P., Rosenkrantz, D., Zhang, H.: Sufficient-completeness, ground-reducibility and their complexity. Acta Informatica\u00a028(4), 311\u2013350 (1991)","journal-title":"Acta Informatica"},{"key":"15_CR14","first-page":"219","volume-title":"Proceedings of ICLP 1987","author":"K. Kunen","year":"1987","unstructured":"Kunen, K.: Answer sets and negation as failure. In: Proceedings of ICLP 1987, pp. 219\u2013228. MIT Press, Cambridge (1987)"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF00243794","volume":"3","author":"J.-L. Lassez","year":"1987","unstructured":"Lassez, J.-L., Marriott, K.: Explicit representation of terms defined by counter examples. Journal of Automated Reasoning\u00a03(3), 301\u2013317 (1987)","journal-title":"Journal of Automated Reasoning"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Transactions on Programming Languages and Systems\u00a04(2), 258\u2013282 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11853886_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T02:49:40Z","timestamp":1552272580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11853886_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540396253","9783540396277"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11853886_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}