Foundations of Information and Knowledge Systems

Autorentext
Dr. habil. Gabriele Kern-Isberner ist Privatdozentin am Fachbereich Informatik der FernUniversität Hagen.

Klappentext

This book constitutes the refereed proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2008 held in Pisa, Italy, in February 2008. The 13 revised full papers presented together with 9 revised short papers and 3 invited lectures were carefully selected during two rounds of reviewing and improvement from from 79 submissions. The papers deal with any foundational aspect of information and knowledge systems, including submissions from researchers working in fields such as discrete mathematics, logic and algebra, model theory, information theory, complexity theory, algorithmics and computation, geometry, analysis, statistics and optimisation who are interested in applying their ideas, theories and methods to research on information and knowledge systems.

Zusammenfassung
An ideal text for researchers and professionals alike, this book constitutes the refereed proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2008 held in Pisa, Italy, in February 2008. The 13 revised full papers are presented together with nine revised short papers and three invited lectures. All of these were carefully selected during two rounds of reviewing and improvement from a total of 79 submissions.

Inhalt
Invited Talks.- Coupling Design and Verification in Software Product Lines.- Random Geometric Identification.- Strategic Abilities of Agents.- Regular Papers.- Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria.- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets.- An Alternative Foundation for DeLP: Defeating Relations and Truth Values.- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes.- Autonomous Sets A Method for Hypergraph Decomposition with Applications in Database Theory.- Cost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning.- Information-Optimal Reflections of View Updates on Relational Database Schemata.- Merging First-Order Knowledge Using Dilation Operators.- On the Existence of Armstrong Instances with Bounded Domains.- Reasoning on Data Models in Schema Translation.- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.- Using Transversals for Discovering XML Functional Dependencies.- Visibly Pushdown Transducers for Approximate Validation of Streaming XML.- A Probabilistic Logic with Polynomial Weight Formulas.- A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases.- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach.- Database Preferences Queries A Possibilistic Logic Approach with Symbolic Priorities.- Defeasible Reasoning and Partial Order Planning.- Lossless Decompositions in Complex-Valued Databases.- SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach.- Towards a Logic for Abstract MetaFinite State Machines.- Towards a Fuzzy Logic for AutomatedMulti-issue Negotiation.