{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:40:51Z","timestamp":1752460851099},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:11:46Z","timestamp":1330258306000},"page":"734-743","source":"Crossref","is-referenced-by-count":8,"title":["Feature constraints with first-class features"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Treinen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(86)90047-2","volume":"45","author":"H. A\u00eft-Kaci","year":"1986","unstructured":"H. A\u00eft-Kaci. An algebraic semantics approach to the effective resolution of type equations. Theoretical Comput. Sci., 45:293\u2013351, 1986.","journal-title":"Theoretical Comput. Sci."},{"key":"64_CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(86)90013-0","volume":"3","author":"H. A\u00eft-Kaci","year":"1986","unstructured":"H. A\u00eft-Kaci and R. Nasr. LOGIN: A logic programming language with built-in inheritance. Journal of Logic Programming, 3:185\u2013215, 1986.","journal-title":"Journal of Logic Programming"},{"unstructured":"H. A\u00eft-Kaci, A. Podelski, and G. Smolka. A feature-based constraint system for logic programming with entailment. In Int. Conf. on 5th Generation Computer Systems, pages 1012\u20131021, 1992.","key":"64_CR3"},{"doi-asserted-by":"crossref","unstructured":"R. Backofen. On the decidability of functional uncertainty. In Rewriting Techniques and Applications, LNCS, 1993. Springer-Verlag.","key":"64_CR4","DOI":"10.3115\/981574.981601"},{"doi-asserted-by":"crossref","unstructured":"R. Backofen and G. Smolka. A complete and recursive feature theory. In Proc. of the 31th ACL, Columbus, Ohio, 1993. Complete version as DFKI Research Report RR-92-30.","key":"64_CR5","DOI":"10.3115\/981574.981600"},{"unstructured":"A. Colmerauer. Equations and inequations on finite and infinite trees. In 2nd Int. Conf. on 5th Generation Computer Systems, pages 85\u201399, 1984.","key":"64_CR6"},{"unstructured":"H. Comon. Unification et disunification. Theorie et applications, 1988. Doctoral Thesis, Institut National Polytechnique de Grenoble.","key":"64_CR7"},{"key":"64_CR8","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"64_CR9","first-page":"111","volume-title":"14th POPL","author":"J. Jaffar","year":"1987","unstructured":"J. Jaffar and J.-L. Lassez. Constraint logic programming. In 14th POPL, pages 111\u2013119, Munich, Germany, Jan. 1987. ACM."},{"key":"64_CR10","volume-title":"CSLI Lecture Notes 16","author":"M. Johnson","year":"1988","unstructured":"M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, CA, 1988."},{"doi-asserted-by":"crossref","unstructured":"E. Kounalies, D. Lugiez, and L. Potier. A solution of the complement problem in associative-commutative theories. In MFCS 1991, LNAI, vol. 520, pages 287\u2013297, Springer-Verlag.","key":"64_CR11","DOI":"10.1007\/3-540-54345-7_72"},{"doi-asserted-by":"crossref","unstructured":"M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Third LICS, pages 348\u2013357. 1988.","key":"64_CR12","DOI":"10.1109\/LICS.1988.5132"},{"key":"64_CR13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(92)90039-6","volume":"12","author":"G. Smolka","year":"1992","unstructured":"G. Smolka. Feature constraint logics for unification grammars. Journal of Logic Programming, 12:51\u201387, 1992.","journal-title":"Journal of Logic Programming"},{"key":"64_CR14","volume-title":"Research Report RR-93-16","author":"G. Smolka","year":"1993","unstructured":"G. Smolka, M. Henz, and J. W\u00fcrtz. Object-oriented concurrent constraint programming in Oz. Research Report RR-93-16, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbr\u00fccken, Germany, Apr. 1993."},{"unstructured":"G. Smolka and R. Treinen. Records for logic programming. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 240\u2013254, 1992.","key":"64_CR15"},{"key":"64_CR16","volume-title":"Research Report RR-92-23","author":"G. Smolka","year":"1992","unstructured":"G. Smolka and R. Treinen. Records for logic programming. Research Report RR-92-23, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, Stuhlsatzen-hausweg 3, D-W-6600 Saarbr\u00fccken, Germany, Aug. 1992."},{"issue":"5","key":"64_CR17","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0747-7171(92)90016-W","volume":"14","author":"R. Treinen","year":"1992","unstructured":"R. Treinen. A new method for undecidability proofs of first order theories. Journal of Symbolic Computation, 14(5):437\u2013457, Nov. 1992.","journal-title":"Journal of Symbolic Computation"},{"key":"64_CR18","volume-title":"Research Report RR-93-21","author":"R. Treinen","year":"1993","unstructured":"R. Treinen. On feature constraints with variable feature access. Research Report RR-93-21, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbr\u00fccken, Germany, 1993."},{"issue":"2","key":"64_CR19","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/23005.24037","volume":"34","author":"K. N. Venkataraman","year":"1987","unstructured":"K. N. Venkataraman. Decidability of the purely existential fragment of the theory of term algebra. J. ACM, 34(2):492\u2013510, Apr. 1987.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:49Z","timestamp":1605647329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}