{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T03:34:42Z","timestamp":1789875282711,"version":"4.0.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s00236-005-0162-6","type":"journal-article","created":{"date-parts":[[2005,3,11]],"date-time":"2005-03-11T15:35:04Z","timestamp":1110555304000},"page":"367-381","source":"Crossref","is-referenced-by-count":6,"title":["On the complexity of deciding typability in the relational algebra"],"prefix":"10.1007","volume":"41","author":[{"given":"Stijn","family":"Vansummeren","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V. (1995) Foundations of databases. Addison-Wesley"},{"key":"CR2","unstructured":"Date, C.J. (1995) An introduction to database systems, 6th edn. Addison-Wesley"},{"key":"CR3","unstructured":"Garey, M.R., Johnson, D.S. (1979) Computer and intractability, a guide to the theory of NP-completeness. Freeman"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Ohori, A., Buneman, P. (1988) Type inference in a database programming language. Proceedings of the 1988 ACM conference on LISP and functional programming. ACM Press","DOI":"10.1145\/62678.62700"},{"key":"CR5","unstructured":"Pierce, B.C. (2002) Types and programming languages. MIT Press"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J. (1978) The complexity of satisfiability problems. Proceedings of the tenth annual ACM symposium on Theory of computing, pp. 216-226. ACM Press","DOI":"10.1145\/800133.804350"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1006\/jcss.2001.1812","volume":"64","author":"Van","year":"2002","unstructured":"Van den Bussche, J., Waller, E. (2002) Polymorphic type inference for the relational algebra. J. Comput. System Sciences 64: 694-718","journal-title":"System Sciences"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0162-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0162-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0162-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:52Z","timestamp":1558705312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0162-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0162-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}