{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:28:57Z","timestamp":1648970937460},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf02451552","type":"journal-article","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:06:09Z","timestamp":1154304369000},"page":"133-173","source":"Crossref","is-referenced-by-count":4,"title":["Some formal properties of stratified feature grammars"],"prefix":"10.1007","volume":"8","author":[{"given":"David E.","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Lawrence S.","family":"Moss","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02451552_CR1","volume-title":"Computational Complexity and Natural Language","author":"E. Barton","year":"1987","unstructured":"E. Barton, R. Berwick and E. Ristad,Computational Complexity and Natural Language (MIT Press, Cambridge, MA, 1987)."},{"key":"BF02451552_CR2","doi-asserted-by":"crossref","unstructured":"E. Barton, The computational difficulty of id\/1p parsing, in:Proc. 23rd Annual Meeting of the Association for Computational Linguistics (1985) pp. 76\u201381.","DOI":"10.3115\/981210.981220"},{"key":"BF02451552_CR3","volume-title":"The Grammatical Basis of Lnguistic Performance","author":"R. Berwick","year":"1984","unstructured":"R. Berwick and A. Weinberg,The Grammatical Basis of Lnguistic Performance (MIT Press, Cambridge, MA, 1984)."},{"key":"BF02451552_CR4","first-page":"189","volume":"10","author":"R. Berwick","year":"1984","unstructured":"R. Berwick, Generative capacity and linguistic theory, Comp. Linguistics 10(1984) 189\u2013202.","journal-title":"Comp. Linguistics"},{"key":"BF02451552_CR5","unstructured":"B. Carpenter, Typed feature structures: Inheritance, (in)equalities and extensionality, in:Proc. 1st Int. Workshop on Inheritance in Natural Language Processing, Tilburg, The Netherlands (1990) pp. 9\u201313."},{"key":"BF02451552_CR6","first-page":"1","volume":"14","author":"G. Gazdar","year":"1988","unstructured":"G. Gazdar, G.K. Pullum, R. Carpenter, E. Klein, T.E. Hukari and R.D. Levine, Category structures, Comp. Linguistics 14(1988)1\u201320.","journal-title":"Comp. Linguistics"},{"key":"BF02451552_CR7","unstructured":"D.E. Johnson and L.S. Moss, Generalizing feature structures for stratified relational analyses,Proc. University of Illinois Conf. on Linguistics and Computation (1991), to appear."},{"key":"BF02451552_CR8","volume-title":"Arc Pair Grammar","author":"D.E. Johnson","year":"1980","unstructured":"D.E. Johnson and P.M. Postal,Arc Pair Grammar (Princeton University Press, Princeton, NJ, 1980)."},{"key":"BF02451552_CR9","unstructured":"M. Johnson,Attribute-Value Logic and the Theory of Grammar, CSLI Lecture Notes, Vol. 16 (University of Chicago Press, 1988)."},{"key":"BF02451552_CR10","unstructured":"A. Joshi and Y. Schabes, Tree adjoining grammars and lexicalized grammars, in:Definability and Recognizability of Sets of Trees (Elsevier, Amsterdam), to appear."},{"key":"BF02451552_CR11","volume-title":"Foundational Issues in Natural Language Processing","author":"A.K. Joshi","year":"1991","unstructured":"A.K. Joshi, K. Vijay-Shanker and D. Weir, The convergence of mildly context-sensitive grammar formalisms, in:Foundational Issues in Natural Language Processing, ed. S. Shieber, P. Sells and T. Wasow (MIT Press, Cambridge, MA, 1991)."},{"key":"BF02451552_CR12","doi-asserted-by":"crossref","unstructured":"A. Joshi, Factoring recursion and dependencies: an aspect of tree adjoining grammars (tag) and a comparison of some formal properties of tags, gpsgs, plgs, and lfgs, in:Proc. 21st Annual Meeting of the Association for Computational Linguistics (1983) pp. 7\u201315.","DOI":"10.3115\/981311.981314"},{"key":"BF02451552_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF00134556","volume":"5","author":"M.B. Kac","year":"1987","unstructured":"M.B. Kac, Surface transitivity, \u201crespectively\u201d coordination and context-freeness, Natural Language and Linguistic Theory 5(1987)441\u2013452.","journal-title":"Natural Language and Linguistic Theory"},{"key":"BF02451552_CR14","doi-asserted-by":"crossref","unstructured":"R. Kasper and W.C. Rounds, A logical semantics for feature structures, in:Proc. 24th Annual Meeting of the ACL (1986) pp. 257\u2013266.","DOI":"10.3115\/981131.981166"},{"key":"BF02451552_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00630516","volume":"13","author":"R. Kasper","year":"1990","unstructured":"R. Kasper and W.C. Rounds, The logic of unification in grammar, Linguistics and Philosophy 13(1990)35\u201358.","journal-title":"Linguistics and Philosophy"},{"key":"BF02451552_CR16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF00584319","volume":"10","author":"A. Manaster Ramer","year":"1987","unstructured":"A. Manaster Ramer, Dutch as a formal language, Linguistics and Philosophy 10 (1987) 221\u2013246.","journal-title":"Linguistics and Philosophy"},{"key":"BF02451552_CR17","unstructured":"M.D. Moshier and W.C. Rounds, A logic for partially specified data structures, in:Proc. 14th Annual Symp. on Principles of Programming Languages, ACM (1986) pp. 156\u2013167."},{"key":"BF02451552_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/978-1-4612-2822-6_16","volume-title":"Proc. MSRI Workshop on Logic from Computer Science","author":"L.S. Moss","year":"1992","unstructured":"L.S. Moss, Completeness theorems for logics of feature structures, in:Proc. MSRI Workshop on Logic from Computer Science ed. Y.N. Moschovakis. (Springer, Berlin, 1992) pp. 387\u2013403."},{"key":"BF02451552_CR19","unstructured":"D.M. Perlmutter (ed.),Studies in Relational Grammar, Vol. 1 (University of Chicago Press, 1983)."},{"key":"BF02451552_CR20","first-page":"277","volume":"17","author":"D. Radzinski","year":"1991","unstructured":"D. Radzinski, Chinese number-names, tree adjoining languages, and mild context-sensitivity, Comp. Linguistics 17(1991)277\u2013299.","journal-title":"Comp. Linguistics"},{"key":"BF02451552_CR21","doi-asserted-by":"crossref","unstructured":"E.S. Ristad, Computational complexity of current gpsg theory, in:Proc. 24th Annual Meeting of the ACL (1986) pp. 30\u201339.","DOI":"10.3115\/981131.981137"},{"key":"BF02451552_CR22","unstructured":"W.C. Rounds and R. Kasper, A complete logical calculus for record structures representing linguistic information, in:Proc. IEEE Symp. on Logic in Computer Science (1986) pp. 38\u201348."},{"key":"BF02451552_CR23","doi-asserted-by":"crossref","unstructured":"W.C. Rounds and A. Manaster Ramer, A logical version of functional grammar, in:Proc. 25th Annual Meeting of the Association for Computational Linguistics (1987) pp. 89\u201396.","DOI":"10.3115\/981175.981188"},{"key":"BF02451552_CR24","first-page":"9","volume-title":"Foundational Issues in Natural Language Processing","author":"W.C. Rounds","year":"1991","unstructured":"W.C. Rounds, The relevance of computational complexity theory to natural language processing, in:Foundational Issues in Natural Language Processing, ed. S. Shieber, P. Sells and T. Wasow (MIT Press, Cambridge, MA, 1991) pp. 9\u201330."},{"key":"BF02451552_CR25","unstructured":"D. Weir, From context-free grammars to tree adjoining grammars and beyond, Ph.D. Thesis, University of Pennsylvania (1987)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02451552.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02451552\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02451552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T19:23:05Z","timestamp":1558120985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02451552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02451552"],"URL":"https:\/\/doi.org\/10.1007\/bf02451552","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}