Foundations of Information and Knowledge Systems | First International Symposium, FoIKS 2000, Burg, Germany, February 14-17, 2000 Proceedings. Questo articolo non è disponibile.Foundations of Information and Knowledge Systems | First International Symposium, FoIKS 2000, Burg, Germany, February 14-17, 2000 Proceedings

This volume contains the papers presented at the \First International Sym- sium on Foundations of Information and Knowledge Systems" (FoIKS 2000), which was held in Burg, Germany from February 14th to 17th, 2000. FoIKSis intendedto beabiannualeventfocussingontheoreticalfoundations ofinformationandknowledgesystems.Itaims to takeupthe oldtraditionofthe conferenceseries \MathematicalFundamentals ofDatabaseSystems" (MFDBS) which encouraged East-West collaboration in the e ld of database theory. F- mer MFDBS conferences were held in Dresden in 1987 (Springer LNCS 305, edited by Joachim Biskup, J anos Demetrovics, Jan Paredaens, and Bernhard Thalheim), in Visegr ad in 1989 (Springer LNCS 364, edited by J anos Demet- vics and Bernhard Thalheim), and in Rostock in 1991 (Springer LNCS 495, edited by Bernhard Thalheim, Jan os Demetrovics, and Hans-Detlef Gerhard). Another goal of the MFDBS conference series has always been to attract researchers working in mathematical e lds such as discrete mathematics, c- binatorics, logics, and nite model theory who are interested in applying their theories to researchon databaseand knowledgebase theory. To that end, FoIKS takes up the tradition of providing a forum for mathematical foundations in a speci c branch of computer science. A r st attempt to reestablish the MFDBS tradition was made in 1995 with a follow-up workshop \Semantics in Datab- es" to ICDT (Springer LNCS 1358, edited by Bernhard Thalheim and Leonid Libkin).

Low Discrepancy Allocation of Two-Dimensional Data.- A Family of Nested Query Languages for Semi-structured Data.- Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints.- Imprecision and User Preferences in Multimedia Queries: A Generic Algebraic Approach.- Maximal Expansions of Database Updates.- Error-Correcting Keys in Relational Databases.- Extension of the Relational Algebra to Probabilistic Complex Values.- Persistent Turing Machines as a Model of Interactive Computation.- On Interactions of Cardinality Constraints, Key, and Functional Dependencies.- Capturing LOGSPACE over Hereditarily-Finite Sets.- Non-situation Calculus and Database Systems.- Dealing with Modification Requests During View Updating and Integrity Constraint Maintenance.- Making Decision Trees More Accurate by Losing Information.- High-Level Logic Programming.- Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases.- Partial Evaluations in a Set-Theoretic Query Language for the WWW.- Minimum Matrix Representation of Some Key System.- Reflective Relational Machines Working on Homogeneous Databases.