Foundations of Information and Knowledge Systems
7th International Symposium, FoIKS 2012, Kiel, Germany, March 5-9, 2012, Proceedings
Published on 29. February 2012
XII, 405 pages
978-3-642-28472-4 (ISBN)
Description
This book constitutes the proceedings of the 7th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2012, held in Kiel, Germany, in March 2012.
The 12 regular and 8 short papers, presented together with two invited talks in full paper-length, were carefully reviewed and selected from 53 submissions. The contributions cover foundational aspects of information and knowledge systems. These include the application of ideas, theories or methods from specific disciplines to information and knowledge systems, such as discrete mathematics, logic and algebra, model theory, informaiton theory, complexity theory, algorithmics and computation, statistics, and optimization.
More details
Other editions
Additional editions
Thomas Lukasiewicz | Attila Sali
Foundations of Information and Knowledge Systems
7th International Symposium, FoIKS 2012, Kiel, Germany, March 5-9, 2012, Proceedings
Book
02/2012
Springer
€53.49
Shipment within 7-9 days
Content
- Title
- Preface
- Conference Organization
- Table of Contents
- Invited Talks
- Uniform Evaluation of Nonmonotonic DL-Programs
- Introduction
- DL-Programs
- Description Logics
- Description Logic Programs
- First-Order Rewritability
- First-Order Rewritable dl-Programs
- Implementation and Experiments
- Limited Recursion
- Datalog Rewritability
- DL Datalog Rewritability and Inline Evaluation
- Inline Evaluation over LDL+ Ontologies
- Inline Evaluation over EL Ontologies
- Implementation and Experiments
- Modular ASP
- Discussion and Conclusion
- Further Work and Outlook
- References
- Foundations of XML Based on Logic and Automata: A Snapshot
- Using Formal Language Theory and Logic for XML Theory
- Analyzing Expressive Power
- Understanding Restrictions
- Algorithms Based on Formal Language Theory
- Challenges for Formal Language Theory and Logic
- Regular Expression Research Triggered by XML
- Data Trees and Data Words
- Pebble Automata and Transitive-Closure Logic on Trees
- Conclusion
- References
- Regular Articles
- Inconsistency-Tolerance in Knowledge-Based Systems by Dissimilarities
- Introduction
- Denotational Semantics and Their Logics
- Inconsistency Tolerance
- Dissimilarity-Based Entailments
- Reasoning with |-3muS
- Applications
- Multi-valued Logics
- Non-deterministic Logics
- Modal Logics
- Conclusion
- References
- Revising Belief without Revealing Secrets
- Introduction
- Problem Statement
- Scenario of Two Interacting Agents
- Outline of Agent D's Belief
- Preserving Confidentiality of Belief towards Agent A
- Organization of Article
- Agent D's Belief
- Uncontrolled Agent Interaction
- A's View on the Uncontrolled Belief Revision Process
- Skeptical Reasoning with Visible Current Assertions
- Skeptical Reasoning with Hidden Assertions
- A Confidentiality Preserving Agent
- Requirements and Architecture
- A Confidentiality Preserving Censor
- Summary and Discussion
- References
- More Than the Sum of Its Parts - Holistic Ontology Alignment by Population-Based Optimisation
- Introduction
- Preliminaries
- Ontology Alignment
- Population-Based Optimisation Heuristics
- Ontology Alignment: A Holistic Optimisation Problem
- Holistic Objective Function
- Solution Representation
- The Charm of Nature-Inspired Optimisation Heuristics
- Ontology Mapping Using Particle Swarm Optimisation
- Ontology Mapping Using Evolutionary Programming
- Advantages of Population-Based Optimisation Heuristics
- Evaluation
- Alignment Quality
- Scalability
- Discussion
- Related Work
- Conclusion
- References
- Handling Preferences in P2P Systems
- Introduction
- Background
- Prioritized Logic Programs
- Integrity Constraints
- A New Semantics for P2P Systems
- An Alternative Characterization of the New Semantics
- Discussion
- Complexity Results
- Related Works
- Concluding Remarks and Directions for Further Research
- References
- Backing and Undercutting in Abstract Argumentation Frameworks
- Introduction
- Dung's Abstract Argumentation Frameworks
- Backing-Undercutting Argumentation Frameworks
- Defeat and Conflict-Freeness
- Acceptability Semantics
- Related Work
- Conclusions
- References
- The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs
- Introduction
- Graphs and Languages
- Relation Algebra Fragments with Coprojection
- Relation Algebra Fragments with at Most Projection and Diversity
- Expressions with Conditionals
- Canonical Subgraphs
- The Key Result
- The Collapse
- Conclusions and Future Work
- References
- Using Functional Dependencies for Reducing the Size of a Data Cube
- Introduction
- Related Work
- Preliminaries
- Selecting Total Cuboids
- Selecting Partial Cuboids
- Condensed Cubes and CFD's
- Quotient Cube and CFD's
- Conclusion
- References
- Armstrong Databases and Reasoning for Functional Dependencies and Cardinality Constraints over Partial Bags
- Introduction
- Related Work
- The Data Model
- Characterizations of the Implication Problem
- Axiomatic Characterization
- Algorithmic Characterization
- Armstrong Tables
- Central Concepts
- Characterization
- Computation
- Complexity Considerations
- Conclusion and Future Work
- References
- FD Covers and Universal Complements of Simple Projections
- Introduction
- Schemata, Views, and Complements
- Universal -Complements and Unique Covers
- Quasi-Universal -Complements
- Conclusions and Further Directions
- References
- Encoding Databases Satisfying a Given Set of Dependencies
- Introduction
- Only One Minimal Key
- A Simple Multivalued Dependency
- Bounds on the Size of 2-Distance-Preserving Codes
- Asymptotic Bounds on cn,m,s
- Related Work
- Open Problems and Future Work
- References
- On Lifted Inference for a Relational Probabilistic Conditional Logic with Maximum Entropy Semantics
- Introduction
- Overview of FO-PCL: Syntax and Semantics
- Imbalanced Sharing and Imbalanced Use of Ground Atoms
- Knowledge Bases in Constraint Normal Form
- Imbalanced Sharing and Inter-Rule Interactions
- Reasons for an Imbalanced Sharing of Ground Atoms
- Reasons for an Imbalanced Sharing of Combinations of Ground Atoms
- Inter-Rule Interactions
- Imbalanced Use and Intra-Rule Interactions
- Reasons for an Imbalanced Use of Ground Atoms
- Reasons for an Imbalanced Use of Combinations of Ground Atoms
- Intra-Rule Interactions
- A Complete Set of Transformation Rules
- Related Work and Conclusions
- References
- Flexible and Efficient Distributed Resolution of Large Entities
- Introduction
- Related Work
- Motivating Example
- Problem Formulation
- The General Model
- The ICAR Conditions and Their Limitation
- The Accessible Subset Model
- Entity Closure: Towards an Efficient Algorithm
- Features
- Distributed Algorithm
- Examples of Indexable Features
- Experiments
- Features and Candidate Generation
- Scalability
- Features and Entity Sizes
- Conclusions and Future Work
- References
- On Real-Valued Evaluation of Propositional Formulas
- Introduction
- Ground Formalism
- Syntax and Semantics
- Axioms and Inference Rules
- Completeness Theorem
- Decidability
- Examples
- Simple Probabilities
- Possibility and Necessity Functions
- Evaluations in Gödel's Fuzzy Logic
- Conclusion
- References
- Detecting Suspect Answers in the Presence of Inconsistent Information
- Introduction
- Notations and Introductory Example
- Related Work
- Automated Data Cleaning Approaches
- Consistent Query Answering
- Detecting Suspect Answers to Selection Queries
- Culprits and Clusters
- Principle of the Approach
- Algorithmic Aspects
- A Gradual View Based on Cardinality
- A Gradual View Based on the Intensity of the Violations
- Dealing with Semi-join Queries
- Union Queries
- Conclusion
- References
- Learning the News in Social Networks
- Introduction
- Groups, Meetings, Information
- Latest Information Graph
- Updating Latest Information
- Achieving Boundedness of Label Sets
- Our Algorithm
- Hypercube
- Conclusions
- References
- Verifying Resource Requirements for Ontology-Driven Rule-Based Agents
- Introduction
- Ontology-Driven Horn Clause Rules
- Ontologies and Rules
- Translation of Ontologies into Rules
- Systems of Communicating Rule-Based Agents
- Concrete Agents
- Abstract Agents
- Example of Two Communicating Agents
- Automated Verification Tool TOVRBA
- Pain Management System
- Related Work
- Conclusions
- References
- Formalizing Production Systems with Rule-Based Ontologies
- Introduction
- Related Work
- Preliminaries
- Production Systems Augmented with Ontologies
- Syntax
- Operational Semantics
- Extending TRPAD with Default Negation
- Declarative Semantics
- Conclusions
- References
- Count Constraints and the Inverse OLAP Problem: Definition, Complexity and a Step toward Aggregate Data Exchange
- Introduction
- Related Work
- Count Constraints
- A Motivating Example
- The Inverse OLAP Problem: Definition and Complexity
- Binary Domain Inverse OLAP
- Binary Attribute Inverse OLAP
- Data Complexity of Inverse OLAP
- A Step towards Aggregate Data Exchange
- Conclusion
- References
- Synchronous Parallel Database Transformations
- Introduction
- The Database-ASM Thesis
- Database Transformations
- Database Abstract State Machines
- Deterministic Synchronous Parallel Database Transformations
- Modified Postulates
- Examples
- Synchronous Parallel Database Abstract State Machines
- The Equivalence Result for Parallel Database ASMs
- Conclusion
- References
- Functional Dependencies on Extended Relations Defined by Regular Languages
- Introduction
- Extended Relations for Regular Types
- FD on Regular Languages
- Functional Dependency Defined on the Dual Language
- Regular FD on XML Schema Languages
- Regular FD on DTD Element Descriptions.
- Regular FD on XML Schema Complex Type.
- Comparing Regular FD with XFDs
- Conclusion and Future Works
- References
- Author Index
