{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:22Z","timestamp":1749221302664,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637530"},{"type":"electronic","value":"9783540696421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0017447","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:46Z","timestamp":1132644166000},"page":"297-311","source":"Crossref","is-referenced-by-count":7,"title":["Ordering constraints over feature trees"],"prefix":"10.1007","author":[{"given":"Martin","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"H. Aft-Kaci and A. Podelski. Entailment and Disentailment of Order-Sorted Feature Constraints. In A. Voronkov, editor, 4th International Conference on Logic Programming and Automated Reasoning, LNAI 698, pp. 1\u201318. Springer, 1993.","DOI":"10.1007\/3-540-56944-8_37"},{"issue":"3","key":"23_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0743-1066(93)90043-G","volume":"16","author":"H. Aft-Kaci","year":"1993","unstructured":"H. Aft-Kaci and A. Podelski. Towards a Meaning of Life. The Journal of Logic Programming, 16(3 and 4):195\u2013234, July, Aug. 1993.","journal-title":"The Journal of Logic Programming"},{"issue":"1-2","key":"23_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","volume":"122","author":"H. Aft-Kaci","year":"1994","unstructured":"H. Aft-Kaci, A. Podelski, and G. Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263\u2013283, Jan. 1994.","journal-title":"Theoretical Computer Science"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"R. Backofen. A Complete Axiomatization of a Theory with Feature and Arity Constraints. The Journal of Logic Programming, 1995. Special Issue on Computational Linguistics and Logic Programming.","DOI":"10.1016\/0743-1066(95)00033-G"},{"issue":"1-2","key":"23_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(94)00188-O","volume":"146","author":"R. Backofen","year":"1995","unstructured":"R. Backofen and G. Smolka. A complete and recursive feature theory. Theoretical Computer Science, 146(1-2):243\u2013268, July 1995.","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","unstructured":"A. Colmerauer. Equations and Inequations on Finite and Infinite Trees. In 2 nd Future Generation Computer Systems, pages 85\u201399, 1984."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"J. D\u00f6rre. Feature-Logic with Weak Subsumption Constraints. In Constraints, Languages, and Computation, chapter 7, pages 187\u2013203. Academic Press, 1994.","DOI":"10.1016\/B978-0-08-050296-0.50014-0"},{"key":"23_CR8","series-title":"Dissertationen zur Kfinstlichen Intelligenz, Band 128","volume-title":"Feature-Logik and Semiunifikation","author":"J. D\u00f6rre","year":"1996","unstructured":"J. D\u00f6rre. Feature-Logik and Semiunifikation. Dissertationen zur Kfinstlichen Intelligenz, Band 128. Infix-Verlag, St. Augustin, 1996."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"J. D\u00f6rre and W. C. Rounds. On Subsumption and Semiunifikation in Feature Algebras. In 5 th IEEE Symposium on Logic in Computer Science, pages 300\u2013310. IEEE Computer Science Press, 1990.","DOI":"10.1109\/LICS.1990.113756"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"R. Helm, K. Marriott, and M. Odersky. Constraint-based Query Optimization for Spatial Databases. In l0th Annual IEEE Symposium on the Principles of Database Systems, pages 181\u2013191, May 1991.","DOI":"10.1145\/113413.113429"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19\/20:503\u2013582, May\u2013July 1994.","journal-title":"Journal of Logic Programming"},{"key":"23_CR12","first-page":"173","volume-title":"Lexical-Functional Grammar: A Formal System for Grammatical Representation","author":"R. M. Kaplan","year":"1982","unstructured":"R. M. Kaplan and J. Bresnan. Lexical-Functional Grammar: A Formal System for Grammatical Representation. pages 173\u2013381. MIT Press, Cambridge, MA, 1982."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"M. Kay. Functional Grammar. In C. Chiarello et al., editor, Proc. of the 5 th Annual Meeting of the Berkeley Linguistics Society, pages 142\u2013158, 1979.","DOI":"10.3765\/bls.v5i0.3262"},{"key":"23_CR14","unstructured":"J. Lassez and K. McAloon. Applications of a Canonical Form for Generalized Linear Constraints. In 5th Future Generation Computer Systems, pages 703\u2013710, Dec. 1988."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"M. M\u00fcller. Ordering Constraints over Feature Trees with Ordered Sorts. In P Lopez, S. Manandhar, and W. Nutt, eds., Computational Logic and Natural Language Understanding, Lecture Notes in Artificial Intelligence, to appear, 1997.","DOI":"10.1007\/BFb0017447"},{"key":"23_CR16","unstructured":"M. M\u00fcller and J. Niehren.Entailment for Set Constraints is not Feasible.Technical report, Programming Systems Lab, Universit\u00e4t des Saarlandes, 1997. Available at http:\/\/www.ps.uni-sb.de\/~mmuel1er\/papers \/conp97.htm1."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"M. M\u00fcller, J. Niehren, and A. Podelski. Inclusion Constraints over Non-Empty Sets of Trees. In International Joint Conference on Theory and Practice of Software Development (TAPSOFT), LNCS, Springer, 1997.","DOI":"10.1007\/BFb0030609"},{"key":"23_CR18","series-title":"Studies in Contemporary Linguistics","volume-title":"Head-Driven Phrase Structure Grammar","author":"C. Pollard","year":"1994","unstructured":"C. Pollard and I. Sag. Head-Driven Phrase Structure Grammar. Studies in Contemporary Linguistics. Cambridge University Press, Cambridge, England, 1994."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"W. C. Rounds. Feature Logics. In J. v. Benthem and A. ter Meulen, editors, Handbook of Logic and Language. Elsevier Science Publishers B.V (North Holland), 1997.","DOI":"10.1016\/B978-044481714-3\/50012-6"},{"key":"23_CR20","unstructured":"S. Shieber. An Introduction to Unification-based Approaches to Grammar. CSLI Lecture Notes No. 4. Center for the Study of Language and Information, 1986."},{"key":"23_CR21","unstructured":"S. Shieber. Parsing and Type Inference for Natural and Computer Languages. SRI Internationax[l Technical Note 460, Stanford University, Mar. 1989."},{"key":"23_CR22","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":"23_CR23","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"G. Smolka. The Oz Programming Model. In J. van Leeuwen, editor, Computer Science Today, LNCS, vol. 1000, pages 324\u2013343. Springer-Verlag, Berlin, Germany, 1995."},{"issue":"3","key":"23_CR24","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"G. Smolka and R. Treinen. Records for Logic Programming. The Journal of Logic Programming, 18(3):229\u2013258, Apr. 1994.","journal-title":"The Journal of Logic Programming"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"R. Treinen. Feature constraints with first-class features. Mathematical Foundations of Computer Science, LNCS, vol. 711, pages 734\u2013743, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57182-5_64"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming-CP97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T20:05:11Z","timestamp":1736107511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637530","9783540696421"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0017447","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}