{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:49:34Z","timestamp":1725475774300},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677789"},{"type":"electronic","value":"9783540449805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721975_13","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T15:43:04Z","timestamp":1167406984000},"page":"187-202","source":"Crossref","is-referenced-by-count":5,"title":["The Explicit Representability of Implicit Generalizations"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"Pichler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","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. Journal of Information and Computation\u00a0112, 167\u2013216 (1994)","journal-title":"Journal of Information and Computation"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"Comon, H., Lescanne, P.: Equational Problems and Disunification. Journal of Symbolic Computation\u00a07, 371\u2013425 (1989)","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1006\/jsco.1998.0203","volume":"26","author":"M. Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, M.: Negation Elimination in Empty or Permutative Theories. Journal of Symbolic Computation\u00a026, 97\u2013133 (1998)","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR4","first-page":"306","volume-title":"Proceedings of LICS 1999","author":"G. Gottlob","year":"1999","unstructured":"Gottlob, G., Pichler, R.: Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. In: Proceedings of LICS 1999, pp. 306\u2013315. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"13_CR5","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, 311\u2013350 (1991)","journal-title":"Acta Informatica"},{"key":"13_CR6","unstructured":"Kunen, K.: Answer Sets and Negation as Failure. In: Proceedings of the Fourth Int. Conf. on Logic Programming, Melbourne, pp. 219\u2013228 (1987)"},{"key":"13_CR7","first-page":"112","volume-title":"Proceedings of LICS 1988","author":"G. Kuper","year":"1988","unstructured":"Kuper, G., McAloon, K., Palem, K., Perry, K.: Effcient Parallel Algorithms for Anti- Unification and Relative Complement. In: Proceedings of LICS 1988, pp. 112\u2013120. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Mathematical Foundations of Computer Science 1991","author":"J.-L. Lassez","year":"1991","unstructured":"Lassez, J.-L., Maher, M., Marriott, K.: Elimination of Negation in Term Algebras. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 1\u201316. Springer, Heidelberg (1991)"},{"key":"13_CR9","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, 301\u2013317 (1987)","journal-title":"Journal of Automated Reasoning"},{"key":"13_CR10","first-page":"348","volume-title":"Proceedings of LICS 1988","author":"M. Maher","year":"1988","unstructured":"Maher, M.: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In: Proceedings of LICS 1988, pp. 348\u2013357. IEEE Computer Society Press, Los Alamitos (1988)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01534454","volume":"15","author":"M. Maher","year":"1995","unstructured":"Maher, M., Stuckey, P.: On Inductive Inference of Cyclic Structures. Annals of Mathematics and Artificial Intelligence\u00a015(2), 167\u2013208 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"13_CR12","unstructured":"Marriott, K.: Finding Explicit Representations for Subsets of the Herbrand Universe, PhD Thesis, The University of Melbourne, Australia (1988)"},{"issue":"2","key":"13_CR13","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"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Pichler, R.: The Explicit Representability of Implicit Generalizations, full paper, available from the author (2000)","DOI":"10.1007\/10721975_13"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-56868-9_24","volume-title":"Rewriting Techniques and Applications","author":"M. Tajine","year":"1993","unstructured":"Tajine, M.: The negation elimination from syntactic equational formulas is decidable. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol.\u00a0690, pp. 316\u2013327. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721975_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:41:46Z","timestamp":1556005306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721975_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677789","9783540449805"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/10721975_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}