ICDT '90. Third international conference on database theory, Paris, France, December 12-14, 1990. Proceedings (Q1188755)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Fagin, Ronald}, Finite-model theory -- a personal perspective, 3-24 [Zbl 0774.03012] \textit{Grumbach, Stéphane; Vianu, Victor}, Playing games with objects, 25-38 [Zbl 0774.03013] \textit{Ohori, Atsushi}, Representing object identity in a pure functional language, 41-55 [Zbl 0789.68037] \textit{Tsotras, Vassilis J.; Gopinath, B.}, Efficient algorithms for managing the history of evolving databases, 141-174 [Zbl 0789.68026] \textit{Revesz, Peter Z.}, A closed form for datalog queries with integer order, 187-201 [Zbl 0789.68042] \textit{Kuper, Gabriel M.}, On the expressive power of the relational calculus with arithmetic constraints, 202-211 [Zbl 0789.68033] \textit{Nummenmaa, Jyrki; Thanisch, Peter}, Conjectures and refutations in database design and dependency theory, 215-228 [Zbl 0789.68036] \textit{Weddell, G. E.; Coburn, N.}, A theory of specialization constraints for complex objects, 229-244 [Zbl 0789.68038] \textit{De Bra, P.; Paredaens, J.}, Removing redundancy and updating databases, 245-256 [Zbl 0789.68028] \textit{Böttcher, Stefan}, Improving the concurrency of integrity checks and write operations, 259-273 [Zbl 0789.68027] \textit{Borghoff, Uwe M.}, Voting and relocation strategies preserving consistency among replicated files, 318-332 [Zbl 0789.68024] \textit{Bidoit, N.; Legay, P.}, WELL!: An evaluation procedure for all logic programs, 335-348 [Zbl 0789.68013] \textit{Brass, Stefan}, Beginnings of a theory of general database completions, 349-363 [Zbl 0789.68029] \textit{van der Meyden, R.}, Recursively indefinite databases, 364-378 [Zbl 0789.68034] \textit{Consens, Mariano P.; Mendelzon, Alberto O.}, Low complexity aggregation in GraphLog and Datalog, 379-394 [Zbl 0789.68030] \textit{Guessarian, Irène}, Deciding boundedness for uniformly connected datalog programs, 395-405 [Zbl 0789.68017] \textit{Willard, Leigh; Yuan, Li Yan}, The revised Gärdenfors postulates and update semantics, 409-421 [Zbl 0774.68092] \textit{Hegner, Stephen J.}, Foundations of canonical update support for closed database views, 422-436 [Zbl 0789.68032] \textit{Decker, Hendrik}, Drawing updates from derivations, 437-451 [Zbl 0789.68031] \textit{Dublish, Pratul; Biskup, Joachim; Sagiv, Yehoshua}, Optimization of a subclass of conjunctive queries, 455-469 [Zbl 0789.68039] \textit{Houtsma, Maurice A. W.; Apers, Peter M. G.; Ceri, Stefano}, Complex transitive closure queries on a fragmented graph, 470-484 [Zbl 0789.68040] \textit{Sippu, Seppo; Soisalon-Soininen, Eljas}, Multiple SIP strategies and bottom-up adorning in logic query optimization, 485-498 [Zbl 0789.68043] \textit{Naughton, Jeffrey F.; Seshadri, S.}, On estimating the size of projections, 499-513 [Zbl 0789.68041] \textit{Debray, Saumya K.; Lin, Nai-Wei}, Static estimation of query sizes in Horn programs, 514-528 [Zbl 0789.68015]