{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:54Z","timestamp":1755220974787,"version":"3.43.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Studia Logica"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1023\/a:1021849625062","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T18:56:02Z","timestamp":1048272962000},"page":"411-432","source":"Crossref","is-referenced-by-count":2,"title":["Interpreting First-order Theories into a Logic of Records"],"prefix":"10.1007","volume":"72","author":[{"given":"Marcel","family":"van de Vel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5115124_CR1","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. J. Logic Programming, 3, 1986. 185-215.","journal-title":"J. Logic Programming"},{"key":"5115124_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","volume":"122","author":"H. A\u00eft-Kaci","year":"1994","unstructured":"H. A\u00eft-Kaci, A. Podelski, and G. Smolka. A feature constraint system for logic programming with entailment. Theoretical Computer Science, 122, 1994. 263-283.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"5115124_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0743-1066(95)00033-G","volume":"24","author":"R. Backofen","year":"1995","unstructured":"R. Backofen. A complete axiomatization of a theory with feature and arity constraints. J. Logic Programming, 24 (1,2), 1995. 37-71.","journal-title":"J. Logic Programming"},{"key":"5115124_CR4","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, 1995. 243-268.","journal-title":"Theoretical Computer Science"},{"key":"5115124_CR5","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530098","volume-title":"The logic of typed feature structures","author":"B. Carpenter","year":"1992","unstructured":"B. Carpenter. The logic of typed feature structures, volume 32 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1992. viii+270pp."},{"key":"5115124_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9452-5","volume-title":"Mathematical logic","author":"J. D. Monk","year":"1976","unstructured":"J. D. Monk. Mathematical logic. Springer verlag, New York, 1976. x+531pp."},{"key":"5115124_CR7","volume-title":"A mathematical introduction to logic","author":"H.B. Enderton","year":"1972","unstructured":"H.B. Enderton. A mathematical introduction to logic. Academic press, New York, 1972. xiii+295pp."},{"key":"5115124_CR8","first-page":"211","volume-title":"A framework for representing knowledge","author":"M. Minsky","year":"1975","unstructured":"M. Minsky. A framework for representing knowledge. The psychology of computer vision (editor P.H. Winston). McGraw-Hill, New York, 1975. 211-277."},{"key":"5115124_CR9","unstructured":"W.C. Rounds and R. Kasper. A complete logical calculus for record structures representing linguistic information. Proc. 1st Ann. Symp. on logic in Computer Science, 1986. 38-43."},{"key":"5115124_CR10","volume-title":"Mathematical logic","author":"J.R. Shoenfield","year":"1967","unstructured":"J.R. Shoenfield. Mathematical logic. Addison-Wesley, Reading, 1967. vii+344pp."},{"key":"5115124_CR11","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. J. Logic Programming, 12, 1992. 51-87.","journal-title":"J. Logic Programming"},{"issue":"3","key":"5115124_CR12","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. J. Logic Programming, 18(3), 1994. 229-258.","journal-title":"J. Logic Programming"},{"key":"5115124_CR13","volume-title":"Conceptual structures: information processing in mind and machine","author":"J.F. Sowa","year":"1984","unstructured":"J.F. Sowa. Conceptual structures: information processing in mind and machine. Addison-Wesley, Reading, Mass., 1984. 481 pp."},{"key":"5115124_CR14","doi-asserted-by":"crossref","unstructured":"A. Tarski and S. Givant. A formalization of set theory without variables, volume 41 of Amer. Math. Soc. Colloq. Publ. Providence, R.I., 1987. xxi+318pp.","DOI":"10.1090\/coll\/041"},{"key":"5115124_CR15","unstructured":"M. van de Vel. Relation algebra with feature symbols. Vrije Universiteit Amsterdam, preprint, 2002. 60pp."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021849625062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021849625062\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021849625062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:22:34Z","timestamp":1754630554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021849625062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["5115124"],"URL":"https:\/\/doi.org\/10.1023\/a:1021849625062","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}