Foundations of Information and Knowledge Systems : 12th International Symposium, FoIKS 2022, Helsinki, Finland, June 20–23, 2022, Proceedings

This book constitutes the refereed proceedings of the 12th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2022, held in Helsinki, Finland, in June 2022. The 13 full papers presented were carefully reviewed and selected from 21 submissions. The papers address various topics such as information and knowledge systems, including submissions that apply ideas, theories or methods from specific disciplines to information and knowledge systems. Examples of such disciplines are discrete mathematics, logic and algebra, model theory, databases, information theory, complexity theory, algorithmics and computation, statistics and optimization. Preface Organization Abstracts of Invited Talks Memory Complexity for Winning Games on Graphs The Relevance of Formal Logics for Cognitive Logics, and Vice Versa More Automation to Software Engineering Dependence Logic: Some Recent Developments Text Classification Using “Imposter” Projections Method Contents On Sampling Representatives of Relational Schemas with a Functional Dependency 1 Introduction 2 Formal Problem Specification 3 Equivalence and Similarity for Normalized Schemas 4 Probabilistic Generation for Normalized Schemas 4.1 Drawing a Class [r] with Proportional Probability 4.2 Drawing a Class [r] with Uniform Probability 4.3 Efficient Random Generation of a Specialized B-Structure SB 5 Results and Issues for Non-normalized Schemas 6 Conclusions References On the Expressive Power of Message-Passing Neural Networks as Global Feature Map Transformers 1 Introduction 2 Related Work 3 Models and Languages 3.1 Graphs and Feature Maps 3.2 Global Feature Map Transformers 3.3 Operations on GFMTs 3.4 Message-passing Neural Networks 3.5 MPLang 3.6 Equivalence 4 From MPLang to MPNN Under ReLU 5 Arbitrary Activation Functions 6 Approximation by ReLU-MPNNs 7 Concluding Remarks References Assumption-Based Argumentation for Extended Disjunctive Logic Programming 1 Introduction 2 Preliminaries 2.1 Assumption-Based Argumentation 2.2 Disjunctive Logic Programs 2.3 Extended Disjunctive Logic Programs 3 ABA for Extended Disjunctive Logic Programming 3.1 Assumption-Based Frameworks Translated from EDLPs 3.2 Correspondence Between Answer Sets of an EDLP and Stable Assumption Extensions 3.3 Arguments and Argument Extensions in ABFs Translated from EDLPs 3.4 Correspondence between Answer Sets of an EDLP and Stable Argument Extensions 3.5 Correspondence Between Answer Sets of a Consistent EDLP and Consistent Stable Argument Extensions 4 Related Work and Conclusion References A Graph Based Semantics for Logical Functional Diagrams in Power Plant Controllers 1 Introduction 2 Motivating Example and Preliminary Notions 2.1 Logical Diagrams 2.2 Test Generation for Logical Diagrams 3 The Sequential Graph of State/Transition (SGST) 4 SGST Construction 4.1 Building the SGST Nodes 4.2 Building the SGST Edges 5 Reasoning with the SGST 5.1 Traversal of the SGST: Trails 5.2 Formal Verification of the Convergence Property in the SGST 6 Discussion References Database Repair via Event-Condition-Action Rules in Dynamic Logic 1 Introduction 2 Background: AICs and Their Semantics 3 ECA Constraints 4 Semantics for ECA Constraints 4.1 Databases with History 4.2 Founded and Well-Founded ECA Repairs 5 Dynamic Logic of Propositional Assignments with Deterministic Past 5.1 Language of DL-PA 5.2 Semantics of DL-PA 6 Well-Founded ECA Repairs in DL-PA 6.1 Well-Founded Weak ECA Repairs 6.2 Well-Founded ECA Repairs 7 Other Decision Problems 7.1 Properties of a Set of ECA Constraints 7.2 Comparing Two Sets of ECA Constraints 7.3 Termination 8 Conclusion References Statistics of RDF Store for Querying Knowledge Graphs 1 Introduction 2 Conceptual Schema of a Knowledge Graph 2.1 Identifiers 2.2 Triples, Types and Graphs 2.3 Triple Patterns 3 Computing Statistics 3.1 Statistics of the Stored Schema Graph 3.2 Statistics of all Schema Triples 3.3 Statistics of a Strip Around the Stored Schema Graph 3.4 On Counting Keys 4 Experimental Evaluation 4.1 Testbed Description 4.2 Knowledge Graph Simple 4.3 Knowledge Graph Yago-S 5 Related Work 6 Conclusions References Can You Answer While You Wait? 1 Introduction 2 Background 2.1 Continuous Queries in Temporal Datalog 2.2 SLD-resolution 2.3 Hypothetical Answers 3 Introducing Communication Delays 3.1 Declarative Semantics 3.2 Operational Semantics 4 Incremental Computation of Hypothetical Answers 5 Related Work 6 Discussion, Conclusions and Future Work References The Implication Problem for Functional Dependencies and Variants of Marginal Distribution Equivalences 1 Introduction 2 Preliminaries 3 Axiomatization for FDs+UMIs+UMDEs 3.1 The Axioms 3.2 Soundness of the Axioms 4 Completeness and Armstrong Relations 5 Complexity of the Implication Problem for FDs+UMIs+UMDEs 6 Conclusion References Approximate Keys and Functional Dependencies in Incomplete Databases with Limited Domains 1 Introduction 2 Basic Definitions 3 Related Work 4 SPKey Approximation 4.1 Measure g5 for SpKeys 5 spFD Approximation 5.1 The Difference of G3 and G5 for SpFDs 5.2 Semantic Comparison of g3 and g5 6 Conclusion and Future Directions References The Fault-Tolerant Cluster-Sending Problem 1 Introduction 2 Formalizing the Cluster-Sending Problem 3 Lower Bounds for Cluster-Sending 4 Cluster-Sending via Bijective Sending 5 Cluster-Sending via Partitioning 6 Performance Evaluation 7 Conclusion References Optimizing Multiset Relational Algebra Queries Using Weak-Equivalent Rewrite Rules 1 Introduction 2 Preliminaries 3 Multiset Relational Algebra 4 Rewriting Queries 4.1 -Joins and -Semi-Joins 4.2 Deduplication 4.3 Other Rewrite Rules 5 Deriving Structural Query Information 6 Rewriting the Example Queries 7 Conclusion References Properties of System W and Its Relationships to Other Inductive Inference Operators 1 Introduction 2 Reasoning with Conditional Logic 3 Syntax Splitting and SPO-Based Inductive Inference 4 System W and the Preferred Structure on Worlds 5 Syntax Splitting and System W 6 Syntax Splitting and the Preferred Structure on Worlds 7 Relations Among Inductive Inference Operators 8 Conclusions and Further Work References Towards the Evaluation of Action Reversibility in STRIPS Using Domain Generators 1 Introduction 2 Background and Related Work 3 Domains for Evaluating Action Reversibility 3.1 Existing Benchmarks for Planning 3.2 Single Path Domain 3.3 Multiple Path Domain 3.4 Dead End Domains 4 Experiments 4.1 Implementation 4.2 Results and Discussion 5 Conclusion References Author Index