Rules and Reasoning International Joint Conference, RuleML+RR 2017, London, UK, July 12-15, 2017, Proceedings

This book constitutes the proceedings of the International Joint Conference on Rules and Reasoning, RuleML+RR 2017, held in London, UK, during July 2017. This is the first conference of a new series, joining the efforts of two existing conference series, namely "RuleML" (International Web...

Full description

Saved in:
Bibliographic Details
Main Authors Costantini, Stefania, Franconi, Enrico, Van Woensel, William, Kontchakov, Roman, Sadri, Fariba, Roman, Dumitru
Format eBook
LanguageEnglish
Published Cham Springer Nature 2017
Springer International Publishing AG
Springer
Edition1
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN3319612522
9783319612522
3319612514
9783319612515

Cover

Table of Contents:
  • 5 Discussion -- References -- Rewriting Queries with Negated Atoms -- 1 Introduction -- 2 Preliminaries -- 2.1 First Order Logic Resolution -- 2.2 Existential Rules -- 2.3 Queries with Negated Atoms -- 3 Rewriting Approach for Queries with Negation -- 3.1 Constraint Saturation -- 3.2 Algorithm for Rewriting Conjunctive Queries with Negation -- 4 Experiments -- 5 Conclusions -- References -- Fast ABox Consistency Checking Using Incomplete Reasoning and Caching -- 1 Introduction -- 2 Preliminaries and Related Work -- 2.1 Inconsistencies and Explanations -- 2.2 DL-LiteA -- 2.3 Inconsistency Detection in DL-LiteA -- 2.4 Learning vs Computing Explanations -- 3 Our Approach -- 3.1 Precompiling DL-LiteA Clash Types -- 3.2 On Demand Reasoning -- 4 Experiments -- 4.1 Setting -- 4.2 Results -- 5 Conclusion and Future Work -- References -- An Online Tool for Tuning Fuzzy Logic Programs -- 1 Introduction -- 2 Symbolic Multi-adjoint Logic Programs -- 3 Running Symbolic Programs -- 4 Tuning Multi-adjoint Logic Programs -- 5 Conclusions and Future Work -- References -- Hybrid ASP-Based Approach to Pattern Mining -- 1 Introduction -- 2 Preliminaries -- 2.1 Patterns -- 2.2 Condensed Pattern Representations Under Constraints -- 2.3 Answer Set Programming -- 3 Hybrid ASP-Based Mining Approach -- 3.1 Encoding Local Constraints -- 3.2 Encoding Global Constraints -- 4 Evaluation -- 5 Related Work -- 6 Conclusion -- References -- Inconsistency-Tolerant Instance Checking in Tractable Description Logics -- 1 Introduction -- 2 Preliminaries -- 3 Instance Checking Under KB Repairs -- 4 Instance Checking Under ABox Repairs -- 5 Conclusions -- References -- ArgQL: A Declarative Language for Querying Argumentative Dialogues -- 1 Introduction -- 2 Related Work -- 3 A Formal Model for Arguments -- 4 ArgQL Specification -- 4.1 Syntax -- 4.2 Semantics -- 4.3 Query Execution
  • References -- Semantic DMN: Formalizing Decision Models with Domain Knowledge -- 1 Introduction -- 2 Case Study -- 2.1 Domain Description -- 2.2 Challenges -- 3 Sources of Decision Knowledge -- 3.1 Logics with Datatypes -- 3.2 DMN Decision Tables -- 4 Semantic Decision Models -- 4.1 Decision Knowledge Bases -- 4.2 Formalizing DKBs -- 4.3 Reasoning Tasks -- 5 Reasoning on Decision Knowledge Bases -- 5.1 Encoding Decision Tables in ALC(D) -- 5.2 Reasoning over ALC(D) Decision Knowledge Bases -- 6 Conclusions -- References -- A Set-Theoretic Approach to ABox Reasoning Services -- 1 Introduction -- 2 Preliminaries -- 2.1 The Set-Theoretic Fragment 4LQSR -- 2.2 The Logic DL"426830A 4LQSR,"526930B (D) -- 3 ABox Reasoning Services for DLD4,-Knowledge Base -- 4 An Algorithm for the HOCQA Problem for DLD4, -- 5 Conclusions and Future Work -- References -- Verifying Controllability of Time-Aware Business Processes -- 1 Introduction -- 2 Preliminaries -- 3 Specification and Semantics of Business Processes -- 4 Encoding Controllability Properties into CHCs -- 5 Solving Controllability Problems -- 6 Related Work and Conclusions -- References -- A Decidable Confluence Test for Cognitive Models in ACT-R -- 1 Introduction -- 2 Preliminaries -- 2.1 Confluence -- 2.2 Adaptive Control of Thought -- Rational (ACT-R) -- 2.3 Constraint Handling Rules (CHR) -- 2.4 Translation of ACT-R to CHR -- 3 Confluence Criterion for ACT-R -- 3.1 Invariant-Based Confluence -- 3.2 ACT-R Invariant -- 3.3 Invariant-Based Confluence Test -- 3.4 Example: Counting -- 4 Related Work -- 5 Conclusion -- References -- On the Chase for All Provenance Paths with Existential Rules -- 1 Introduction -- 2 Preliminaries -- 3 Constructing the Graph of Atom Dependency -- 3.1 Provenance Paths -- 3.2 Graph of Atom Dependency (GAD) -- 3.3 Chase Variants for GAD -- 4 Obtaining Provenance Paths
  • Intro -- Preface -- Organization -- Keynote Talks -- Opening the Black Box: Deriving Rules from Data -- The Secret Life of Rules in Software Engineering -- Contents -- Meta-Interpretive Learning: Achievements and Challenges (Invited Paper) -- 1 Introduction -- 2 Simple Worked Example -- 3 Vision Applications -- 4 Challenges -- References -- Dischargeable Obligations in Abductive Logic Programming -- 1 Introduction -- 2 SCIFF language and semantics -- 3 SCIFFD Language -- 4 SCIFFD Declarative and Operational Semantics -- 4.1 Declarative Semantics -- 4.2 Operational Semantics -- 4.3 Soundness -- 5 Related Work -- 6 Conclusions -- References -- Using Rule-Based Reasoning for RDF Validation -- 1 Introduction -- 2 Related Work -- 3 RDF Validation Constraints -- 4 Features Required for Validation -- 4.1 Reasoning -- 4.2 Scoped Negation as Failure -- 4.3 Predicates for Name Comparison -- 4.4 RIF Built-Ins -- 5 Validation with N3Logic -- 5.1 N3Logic -- 5.2 Expressing Constraints -- 5.3 Constraint Rules -- 6 Conclusion and Future Work -- References -- Three Methods for Revising Hybrid Knowledge Bases -- 1 Introduction -- 2 Preliminaries -- 2.1 Hybrid Knowledge Bases Under Here-and-There Logic -- 2.2 Belief Change -- 3 Revision in Hybrid Knowledge Bases -- 3.1 Partial Meet Revision -- 3.2 Protected Revision -- 3.3 Prioritised Revision -- 4 Related Work -- 5 Conclusion -- References -- Can My Test Case Run on Your Test Plant? A Logic-Based Compliance Check and Its Evaluation on Real Data -- 1 Introduction -- 2 Test Plants and Test Cases in BlindedCompany -- 2.1 Test Plants -- 2.2 Current Representations of TPs and TCs in BlindedCompany -- 3 Modeling PCTPs and MCTP(TC)s in UML and Prolog -- 3.1 POTP -- 3.2 Test Plant (PCTP) and Test Case (MCTP) Representation -- 4 Compliance Algorithm -- 5 Implementation and Experiments -- 6 Related Works and Conclusions
  • 5 Research Plans and Conclusions -- References -- Author Index