Foundations of Information and Knowledge Systems: 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17–21, 2020, Proceedings (Lecture Notes in Computer Science (12012))

This book constitutes the refereed proceedings of the 11th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2020, held in Dortmund, Germany, in February 2020. The 19 revised full papers presented were carefully reviewed and selected from 33 submissions. The papers address various topics such as big data; database design; dynamics of information; information fusion; integrity and constraint management; intelligent agents; knowledge discovery and information retrieval; knowledge representation, reasoning and planning; logics in databases and AI; mathematical foundations; security in information and knowledge systems; semi-structured data and XML; social computing; the semantic web and knowledge management; and the world wide web.​ Preface Organization Abstracts of Invited Talks First-Order Logic of Information Flows: Expressibility, Primitivity, Input-Output Properties, and Limited Access Patterns Implicit Coordination of Mobile Agents Computation on Structures: Behavioural Theory, Logic and Complexity Description Logics for Typicality and Nonmonotonic Reasoning Contents Functional Dependencies in Incomplete Databases with Limited Domains 1 Introduction 2 Basic Definitions 2.1 Strongly Possible Worlds 2.2 NULL-Free Subschema 3 Related Work 4 Complexity of Strongly Possible Keys 5 Strongly Possible Functional Dependencies 5.1 Basic Properties of spFD's 6 Conclusions References Normal Forms of Conditional Knowledge Bases Respecting Entailments and Renamings 1 Introduction 2 Background: Conditional Logic 3 Reduced Antecedentwise Normal Form 4 Transforming Knowledge Bases into Reduced ANF 5 Renamings and Renaming Normal Form (NF) 6 Generating Knowledge Bases in RANF and NF 6.1 Basic Algorithm KBbasicra 6.2 Improved Algorithm KBra 7 Conclusions and Further Work References On Matrices and K-Relations 1 Introduction 2 Annotated-Relation Algebra 3 Composition and Equivalence 3.1 Connection with FO(k) 4 Matrices 4.1 MATLANG 4.2 Simulating MATLANG in (ARA+2)(2) 4.3 Simulating (ARA+2)(2) in MATLANG 4.4 Relationship with ARA(3) and Complexity 5 Conclusion References Social Consolidations: Rational Belief in a Many-Valued Logic of Evidence and Peerhood 1 Introduction 2 Syntax and Semantics 2.1 Syntax 2.2 Semantics 3 Rationality Conditions for Consolidations 3.1 Epistemic Autonomy Versus Epistemic Authority 3.2 Rationality Postulates 4 Social Consolidations 4.1 Preliminaries 4.2 Consolidation Policies 5 Dynamics 6 Related Work 7 Conclusions and Future Work References ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation 1 Introduction 2 Preliminaries 2.1 Abstract Argumentation 2.2 Tracks of ICCMA'19 3 The ASPARTIX System and Its V19 Edition 4 Implementation Details 4.1 Conditional Literals 4.2 Domain Heuristics 4.3 Multi-shot Methods 5 Discussion References Proper Hierarchies in Polylogarithmic Time and Absence of Complete Problems 1 Introduction 2 Polylogarithmic Time Complexity Classes 3 Logics for Polylogarithmic Time 4 Problems that Lead to Proper Hierarchies 5 Proper Hierarchies in Polylogarithmic Time 6 On Polylogarithmic-Time and Complete Problems 7 Concluding Remarks References Diversity, Dependence and Independence 1 Introduction 2 Diversity Rank in a General Setting 3 Examples 4 From Diversity to Dependence 5 From Diversity to Independence 5.1 Dependence/Independence Axioms 6 Conclusions References Towards Probabilistic Reasoning in Type Theory - The Intersection Type Case 1 Introduction 2 Preliminaries 2.1 Probabilistic Logic 2.2 Intersection Type Assignment 3 Probabilistic Logical System for Lambda Terms with Intersection Types P 3.1 Syntax of P 3.2 Semantics of P 4 The Axiomatization AxP 5 The Logic PFr(n) 6 Conclusion References Measuring Inconsistency in a General Information Space 1 Introduction 2 Brief Background on Inconsistency Measures for Propositional Knowledge Bases 3 General Information Spaces 4 Transforming a General Information Space to a Propositional Knowledge Base 5 Examples of Instantiation 5.1 A Relational Database as a General Information Space 5.2 A Graph Database as a General Information Space 5.3 A Blocks World Configuration as a General Information Space 6 Conclusions and Future Work References Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic 1 Introduction 2 Preliminaries 2.1 Parameterised Complexity 2.2 Propositional Dependence Logic 2.3 Representation of Inputs as Graphs 2.4 Considered Parameterisations 3 Parameterised Complexity of Model Checking in PDL 4 Satisfiability 5 Conclusion References Utilizing Deep Learning and RDF to Predict Heart Transplantation Survival 1 Introduction 2 Related Works 3 Medical Registries 4 Resource Description Framework 5 Representing the Data in RDF 6 Querying the Database 7 Deep Learning Models 8 Applications 8.1 Explore and Understand the Data 8.2 Predict the Survival Before Transplant 8.3 Predict the Survival After Transplant 8.4 Simulating the Impact of Allocation Policies 9 Conclusion 10 Future Work References Game Description Logic with Integers: A GDL Numerical Extension 1 Introduction 2 Game Description Logic with Integers 2.1 Syntax 2.2 Semantics 2.3 Model Checking 3 Translation Between GDLZ and GDL 3.1 From GDLZ Paths and Models to GDL Models 3.2 From Finite GDLZ Model to GDL Model 3.3 From GDL to GDLZ 3.4 Succinctness 4 Conclusion References Craig Interpolation of Epistemic Logics with Distributed Knowledge 1 Introduction 2 Overview of Epistemic Logics with Distributed Knowledge Operators 2.1 Language 2.2 Kripke Semantics 2.3 Hilbert Systems 3 Sequent Calculi of Epistemic Logics with Distributed Knowledge 4 Main Proof-Theoretic Results 4.1 Cut Elimination 4.2 Craig Interpolation Theorem 5 Concluding Remark References On the Dynamics of Structured Argumentation: Modeling Changes in Default Justification Logic 1 Introduction 2 Logic of Default Reasons 2.1 Logic of Factive Reasons JTCS 2.2 Logic of Default Reasons 3 Dynamic Operations for Default Theories: Introducing Undermining Attack 3.1 Default Theory Expansion 3.2 Default Theory Contraction 3.3 Default Theory Revision 3.4 The Notion of Undermining 4 Related Work and Conclusions References Logic-Based Approach to Incremental Monitoring and Optimization on Strongly Distributed Data Streams 1 Introduction 1.1 Monitoring and Optimization on Streams: Related Work 1.2 A Motivating Example: Alternation of Data Streams 1.3 Novelty of the Contribution: Logical Tools 1.4 Incremental Monitoring and Optimization on Strongly Distributed Data Streams 1.5 Structure of the Contribution 2 Quantitative Querying 2.1 Weighted Monadic Second Order Logic 2.2 Expressive Power of WMSOL 3 Weighted Translation Schemes 4 Incremental Analysis of Quantitative Properties of Strongly Distributed Streams 4.1 Disjoint Union of Weighted Labeled Words 4.2 Strongly Distributed Systems 4.3 The General Approach 5 Conclusion and Discussion References Realisability of Choreographies 1 Introduction 2 P2P Communication Systems and Choreographies 2.1 Composition of Peers 2.2 Trace Semantics 2.3 Choreography-Defined P2P Systems 3 Characterisation of Realisability 3.1 The Sequence Condition 3.2 The Choice Condition 3.3 Sufficient Conditions for Realisability 3.4 Choreography Repair 4 Conclusion References Schema Optimisation Instead of (Local) Normalisation 1 Normalisation - the Good, the Bad, the Ugly 1.1 Local Vertical Normalisation Based on Functional and Other Dependencies 1.2 Local Vertical Normalisation 1.3 Inclusion Constraint Maintenance After Decomposition 1.4 Constraint Sets Instead of Sets of Constraints 1.5 The Storyline of the Paper 2 Solutions for Classical Normalisation Approaches 2.1 Refining Synthesis Algorithms 2.2 Balancing Between Conceptualisation and Programming Adequacy 2.3 Accuracy of the Internal Database Structure 2.4 Infomorphisms Among Schemata 2.5 Global and Local Vertical Normalisation 3 Denormalisation 3.1 State-Of-the-Art for Denormalisation 3.2 A Matter of Definition 3.3 Denormalisation Driven by Optimisation 4 Conclusion 4.1 Summarising 4.2 Open Problems References Strongly Minimal MapReduce Algorithms: A TeraSort Case Study 1 Introduction 1.1 Strongly Minimal MapReduce Algorithms 2 Related Work 3 Sorting with MapReduce 3.1 Sampling and Partitioning 3.2 Even Partitions 3.3 TeraSort 4 A New Proof of TeraSort's Minimality 4.1 Probability Tools 4.2 Minimality 5 Proof of TeraSort's Strong Minimality 5.1 Tightening the Bound 6 Conclusions References Event Sequence Interpretation of Structural Geomodels: A Knowledge-Based Approach for Extracting Tectonic Sequences 1 Introduction 2 Knowledge Representation 3 Recognition of Events 3.1 Events and Objects 3.2 Event Pattern Matching Model 4 Events Ordering 5 Experiment 6 Conclusions References Author Index