{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:30:33Z","timestamp":1752460233721},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00188-o","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"243-268","source":"Crossref","is-referenced-by-count":19,"title":["A complete and recursive feature theory"],"prefix":"10.1016","volume":"146","author":[{"given":"Rolf","family":"Backofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gert","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00188-O_bib1","article-title":"A lattice-theoretic approach to computation based on a calculus of partially ordered type structures","author":"A\u00eft-Kaci","year":"1984"},{"key":"10.1016\/0304-3975(94)00188-O_bib2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(86)90047-2","article-title":"An algebraic semantics approach to the effective resolution of type equations","volume":"45","author":"A\u00eft-Kaci","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00188-O_bib3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(86)90013-0","article-title":"LOGIN: A logic programming language with built-in inheritance","volume":"3","author":"A\u00eft-Kaci","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)00188-O_bib4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01806313","article-title":"Integrating logic and functional programming","volume":"2","author":"A\u00eft-Kaci","year":"1989","journal-title":"Lisp Symbolic Computation"},{"key":"10.1016\/0304-3975(94)00188-O_bib5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0743-1066(93)90043-G","article-title":"Towards a meaning of LIFE","volume":"16","author":"A\u00eft-Kaci","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)00188-O_bib6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","article-title":"A feature-based constraint system for logic programming with entailment","volume":"122","author":"A\u00eft-Kaci","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00188-O_bib7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01051766","article-title":"On the expressivity of feature logics with negation, functional uncertainty, and sort equations","volume":"2","author":"Baader","year":"1993","journal-title":"J. Logic, Language Inform."},{"key":"10.1016\/0304-3975(94)00188-O_bib8","series-title":"Cambridge Tracts in Theoretical Computer Science","article-title":"The Logic of Typed Feature Structures; with Applications to Unification Grammars, Logic Programs and Constraint Resolution","author":"Carpenter","year":"1992"},{"key":"10.1016\/0304-3975(94)00188-O_bib9","series-title":"Logic Programming","first-page":"153","article-title":"Prolog and infinite trees","author":"Colmerauer","year":"1982"},{"key":"10.1016\/0304-3975(94)00188-O_bib10","series-title":"Proc. 2nd Internat. Conf. on Fifth Generation Computer Systems","first-page":"85","article-title":"Equations and inequations on finite and infinite trees","author":"Colmerauer","year":"1984"},{"key":"10.1016\/0304-3975(94)00188-O_bib11","article-title":"Attribute-Value Logic and the Theory of Grammar","author":"Johnson","year":"1988"},{"key":"10.1016\/0304-3975(94)00188-O_bib12","series-title":"Proc. of IJCAI-91","article-title":"Logic and feature structures","author":"Johnson","year":"1991"},{"key":"10.1016\/0304-3975(94)00188-O_bib13","series-title":"The Mental Representation of Grammatical Relations","first-page":"173","article-title":"Lexical-functional grammar: A formal system for grammatical representation","author":"Kaplan","year":"1982"},{"key":"10.1016\/0304-3975(94)00188-O_SB0070","series-title":"Linguistics and Philosophy","first-page":"13","article-title":"The logic of unification in grammar","author":"Kasper","year":"1990"},{"key":"10.1016\/0304-3975(94)00188-O_SB0075","series-title":"Linguistics and Philosophy","first-page":"35","article-title":"The logic of unification in grammar","author":"Kasper","year":"1990"},{"key":"10.1016\/0304-3975(94)00188-O_bib15","series-title":"Proc. 24th Ann. Meeting of the ACL, Columbia University","first-page":"257","article-title":"A logical semantics for feature structures","author":"Kasper","year":"1986"},{"key":"10.1016\/0304-3975(94)00188-O_bib16","series-title":"Proc. Fifth Ann. Meeting of the Berkeley Linguistics Society","article-title":"Functional grammar","author":"Kay","year":"1979"},{"key":"10.1016\/0304-3975(94)00188-O_bib17","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Unification revisted","author":"Lassez","year":"1988"},{"key":"10.1016\/0304-3975(94)00188-O_bib18","series-title":"Proc. 3rd Ann. Symp. on Logic in Computer Science","first-page":"348","article-title":"Complete axiomatizations of the algebras of finite, rational and infinite trees","author":"Maher","year":"1988"},{"key":"10.1016\/0304-3975(94)00188-O_bib19","series-title":"Logic from Computer Science","first-page":"387","article-title":"Completeness theorems for logics of feature structures","author":"Moss","year":"1992"},{"key":"10.1016\/0304-3975(94)00188-O_bib20","series-title":"Proc. 1st IEEE Symp. on Logic in Computer Science","first-page":"38","article-title":"A complete logical calculus for record structures representing linguistic information","author":"Rounds","year":"1986"},{"key":"10.1016\/0304-3975(94)00188-O_bib21","article-title":"An Introduction to Unification-Based Approaches to Grammar","author":"Shieber","year":"1986"},{"key":"10.1016\/0304-3975(94)00188-O_bib22","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(92)90039-6","article-title":"Feature constraint logics for unification grammars","volume":"12","author":"Smolka","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)00188-O_bib23","first-page":"229","article-title":"Records for logic programming","volume":"18","author":"Smolka","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400188O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400188O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:28:19Z","timestamp":1555417699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400188O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400188O"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00188-o","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}