Foundations of information and knowledge systems : 5th international symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008 : proceedings

• Main Authors: Hartmann, Sven, Kern-Isberner, Gabriele
• Format: eBook Book
• Language: English
• Published: Berlin Springer 2008; Springer Berlin / Heidelberg
• Edition: 1
• Series: Lecture Notes in Computer Science
• Subjects: Computer systems; Computer systems > Congresses; Congresses; Information technology; Information technology > Congresses
• ISBN: 3540776834; 9783540776833

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 sel...

Table of Contents:

• Author Index
• Intro -- Preface -- Conference Organization -- Table of Contents -- Coupling Design and Verification in Software Product Lines -- Random Geometric Identification -- Strategic Abilities of Agents -- 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 Automated Multi-issue Negotiation
• LR-Reduced Covers and Applications -- Related Work -- Cost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning -- Introduction -- Combining Classification Error and Labelling Cost -- Related Work -- Stopping Algorithms -- When No Model Is Perfect: Bayesian Model Selection -- The OBSV Algorithm -- Experimental Evaluation -- Discussion -- References -- Information-Optimal Reflections of View Updates on Relational Database Schemata -- Introduction -- The Relational Model -- The General Theory of Updates -- Optimal Insertion in the Context of XEIDs -- Conclusions and Further Directions -- Merging First-Order Knowledge Using Dilation Operators -- Introduction -- Background on Propositional Knowledge Merging -- Motivation for Dilation-Based Merging -- Framework for Dilation-Based Merging -- Preliminaries -- Dilation Operators -- Comparison Orderings -- Merging Operators -- Examples of Dilation-Based Merging -- Properties of Merging Operators -- Conclusions -- Proof of Proposition 1 -- On the Existence of Armstrong Instances with Bounded Domains -- Introduction -- Upper Bound -- Lower Bound -- Conclusions -- Reasoning on Data Models in Schema Translation -- Introduction -- Context and Goals -- Signatures of Constructs and Models -- Signatures of Datalog Rules and Their Application -- Inferring Models from Rules -- Applications of the Results -- Related Work -- Conclusions -- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings -- Introduction -- Representation Requirements -- Description Logics -- Tightly Integrated Disjunctive DL-Programs -- Representing Ontology Mappings -- Tightly Integrated Probabilistic DL-Programs -- Representing Ontology Mappings with Confidence Values -- Algorithms and Complexity -- Tractability Results -- Conclusion
• Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Coupling Design and Verification in Software Product Lines -- Motivation -- Combined Stepwise Refinement of Design and Verification Features -- Outlook -- Random Geometric Identification -- Strategic Abilities of Agents -- Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria -- Introduction -- Aggregating Attack Relations -- Arrow's Conditions on Aggregation Functions -- Decisive Sets of Attack Relations -- Discussion -- Further Work -- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets -- Introduction -- Background -- Model-Theoretic Characterizations by Unfounded Sets -- Characterizations for Program Equivalence -- Characterizations Based on Unfounded Sets -- Characterizations in (Standard) Propositional Logic -- Characterizations in Quantified Propositional Logic -- Discussion -- An Alternative Foundation for DeLP: Defeating Relations and Truth Values -- Introduction and Motivation -- The Basics of DeLP -- Warrant Games -- Finite Warrant Games -- The Defeating Relation and Truth Values -- Conclusions and Future Work -- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes -- Introduction -- Dependencies in Relational Databases -- Inadequate Reasoning in Fixed Universes -- Appropriate Reasoning in Fixed Universes -- Nearly Complete Reasoning in Fixed Universes -- Complete Reasoning in Undetermined Universes -- Extension to Full Hierarchical Dependencies -- Conclusion -- Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory -- Introduction -- Hypergraph Decomposition -- Autonomous Sets -- Computing Autonomous Sets -- Superedges and Partial Superedges -- Canonical Covers -- Partial Covers -- An NP-Hardness Result
• Using Transversals for Discovering XML Functional Dependencies -- Introduction -- Preliminary -- XML Schema Tree and XML Data Tree -- Subgraph Terminology -- XML Functional Dependencies -- Related Work -- Transversal Approach to Mining XFDs -- Finding Difference Sets of T' -- Finding Difference Sets from Agree Sets -- Finding Agree Sets -- Conclusion -- Visibly Pushdown Transducers for Approximate Validation of Streaming XML -- Introduction -- Related Work -- Visibly Pushdown Automata -- Visibly Pushdown Transducers -- VPTs for Edit Operations under the First Semantics -- Substitution -- Deletion -- Insertion -- A VPT for All Operations -- VPTs for Edit Operations under the Second Semantics -- Substitution -- Deletion -- Insertion -- A VPT for All Operations -- Repairs -- Concluding Remarks -- A Probabilistic Logic with Polynomial Weight Formulas -- Introduction -- Syntax and Semantics -- Axiomatization -- Completeness -- Decidability and Complexity -- Conclusion -- A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases -- Introduction -- Basic Concepts -- Deductive Databases -- Normalized Definite Rules -- Disjunctive Deductive Databases -- Update Propagation -- View Updating -- Top-Down Computation of Realizations -- Bottom-Up Assessment of Realizations -- Overall Organization of View Updating -- Discussion -- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach -- Introduction -- Logical Argumentation for a Language of Clauses -- Towards Effective Algorithms for Generating Arguments -- Connection Graphs -- Searching Query Graphs -- Algorithms -- Algorithm for Building the Query Graph -- Algorithm for Finding the Formulae for Each Presupport Tree (Algorithm 1) -- Algorithm for Checking Support Tree Conditions -- Experimental Results -- Discussion
• Database Preferences Queries - A Possibilistic Logic Approach with Symbolic Priorities -- Introduction -- Background -- Databases Approaches to Preference Handling in Querying -- The Fuzzy Set-Based Approach to Flexible Querying -- The CP-Net-Based Approach to Preference Processing -- A Symbolic Possibilistic Logic Approach -- Comparative Preferences -- Non-binary Attributes -- Concluding Remarks -- Defeasible Reasoning and Partial Order Planning -- Introduction -- Motivation -- Defeasible Argumentation and Actions -- Argumentation in Partial Order Planning -- Interferences among Actions and Arguments -- Proposed Algorithm -- Related Work -- Conclusions -- Lossless Decompositions in Complex-Valued Databases -- Introduction -- The Relational Model of Data -- Lossless Decompositions - The Relational Case -- The Complex-Valued Data Model -- Lossless Decomposition -- Conclusion -- SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach -- Introduction -- Decision Trees -- Possibility Theory -- Similarity Based Possibilistic Decision Trees -- Imperfection in Classification Problems -- Building Procedure -- Classification Procedure -- Experimental Results -- Conclusion -- Towards a Logic for Abstract MetaFinite State Machines -- Introduction -- Metafinite States -- Basic Definitions -- Background Structures -- Abstract Metafinite State Machines -- A Logical Formalization -- Syntax and Semantics -- Axioms and Inference Rules -- Discussion and Conclusion -- Towards a Fuzzy Logic for Automated Multi-issue Negotiation -- Introduction -- Negotiation Mechanism -- Representation of Issues -- Multi Issue Bilateral Negotiation in P(N) -- Computing Pareto Agreements in P(N) -- The Bargaining Process -- Related Work and Discussion -- Author Index