Web reasoning and rule systems : 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013 : proceedings

This book constitutes the refereed proceedings of the 7th International Conference on Web Reasoning and Rule Systems, RR 2013, held in Manheim, Germany in July 2013. The 19 revised research papers and 4 technical communications presented together with 2 invited talks and 1 tutorial talk were carefully reviewed and selected from 34 submissions. The scope of conference is decision making, planning, and intelligent agents, reasoning, machine learning, knowledge extraction and IR technologies, large-scale data management and reasoning on the web of data, data integration, dataspaces and ontology-based data access, non-standard reasoning, algorithms for distributed, parallelized, and scalable reasoning, and system descriptions and experimentation. Web Reasoning and Rule Systems Preface 5 Organization 6 Table of Contents 10 Invited Talks 10 Inconsistency Management for Description Logic Programs and Beyond 13 1 Overview 13 References 15 Reasoning About Pattern-Based XML Queries 16 1 Introduction 16 2 Relational Patterns and Pattern-Based Queries 17 3 Trees, Patterns 19 3.1 Data Trees 19 3.2 Patterns 20 4 Basic Analysis of Patterns 21 5 Pattern-Based Queries 22 6 Containment of Pattern-Based Queries 24 7 Certain Answers over Patterns 26 8 Tree Patterns in Data Exchange 28 References 29 Answer Set Programming: Language, Applications and Development Tools 31 1 Introduction 31 2 Answer Set Programming 32 3 Industrial Applications 34 3.1 WorkforceManagement 34 3.2 E-Tourism Platform 36 3.3 Other Applications 37 4 Development Tools 37 4.1 ASPIDE 37 4.2 JDLV 40 5 Conclusion 44 References 44 Full Papers 10 A Variant of Earley Deduction with Partial Evaluation 47 1 Introduction 47 2 Basic Definitions 48 3 Deduction Method 49 4 Partial Evaluation 55 5 Termination of Partial Evaluation 60 6 Conclusions 60 References 61 Verification and Synthesis in Description Logic Based Dynamic Systems 62 1 Introduction 62 2 Framework 63 3 Specification Logic 66 4 Verification 68 5 Adversarial Synthesis 70 6 Instantiations of the Framework 73 7 Conclusion 74 References 74 Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas 77 1 Introduction 77 2 The Logic 78 3 An Algorithm for 83 4 Implementation and Evaluation 86 5 Conclusions and Future Work 89 References 89 Computing Incoherence Explanations for Learned Ontologies 92 1 Motivation 92 2 Related Work 94 3 Preliminaries 95 4 Approach 96 5 Experiments 100 5.1 Setting 100 5.2 Results 101 6 Future Work 104 7 Summary 105 References 105 An Ontology-Based Reasoning Approach for Electric Power Utilities 107 1 Introduction 107 2 Related Work 108 3 The Common Information Model: CIM 109 4 Linking Heterogeneous Data with CIM Ontology 111 5 Experiments 112 5.1 Experimental Setup 112 5.2 Finding Ringlets in Distribution Network 113 5.3 Consistency Checking 116 5.4 Topological Nodes 117 6 Conclusion and Future Work 119 References 119 Conjunctive Queries with Negation over DL-Lite: A Closer Look 121 1 Introduction 121 2 Preliminaries 122 3 Answering CQs with Safe Negation is Undecidable 124 4 Answering CQs with One Inequality is Undecidable 127 5 Lower Bounds for CQ 132 Answering without Role Inclusions 132 6 Conclusions 134 References 134 On the Exploration of the Query Rewriting Space with Existential Rules 135 1 Introduction 135 2 Framework 137 2.1 Preliminaries 137 2.2 Desirable Properties of Rewriting Sets 138 3 A Generic Breadth-First Rewriting Algorithm 138 3.1 Algorithm 139 3.2 Correctness of the Algorithm 140 3.3 Preserving Soundness and Completeness 140 3.4 Termination of the Algorithm 141 4 Piece-Based Rewriting Revisited 141 4.1 Piece-Based Rewriting 141 4.2 Piece-Based Rewriting Operator 143 4.3 Single-Piece-Based Rewriting is not Prunable 144 5 Aggregated Piece-Based Rewriting 145 6 Optimization, Experiments and Perspectives 146 6.1 Optimization 146 6.2 Experiments 147 6.3 Perspectives 148 References 148 Incomplete Information in RDF 150 1 Introduction 150 1.1 Contributions 151 2 Constraint Languages 152 3 TheRDFi Framework 153 4 Semanticsof RDFi 154 5 Evaluating SPARQL on RDFi Databases 155 6 Representation Systems for RDFi 158 7 Certain Answer Computation 161 7.1 Data Complexity Results 162 8 Related Work 163 9 Future Work 164 References 164 RIO: Minimizing User Interaction in Ontology Debugging -1 1 Introduction -1 2 Basic Concepts and Motivation -1 3 Risk Optimization for Query Selection -1 4 Evaluation -1 5 Related Work -1 6 Conclusion -1 References -1 Eliminating Nonmonotonic DL-Atoms in Description Logic Programs 180 1 Introduction 180 2 Preliminaries 182 2.1 Description Logics 182 2.2 Description Logic Programs: Syntax and Models 182 2.3 Strong andWeak Answer Sets 184 3 Eliminating Constraint Operators from Nonmonotonic Dl-Atoms 185 4 Complexity of Deciding Monotonicity of Dl-Atoms 188 4.1 Description Logic DL-LiteR 188 4.2 Description logic 190 4.3 Description Logics 191 5 Discussion and Conclusion 192 5.1 RelatedWork 192 5.2 Open Issues 193 References 193 BUNDLE: A Reasoner for Probabilistic Ontologies 195 1 Introduction 195 2 Description Logics 196 3 The DISPONTE Semantics for Probabilistic Description Logics 198 4 BUNDLE 202 5 Related Work 205 6 Experiments 205 7 Conclusions 207 References 208 Technical Communications 11 Detection of Inconsistencies in Rules Due to Changes in Ontologies: Let’s Get Formal 210 1 Introduction 210 2 The Problem 211 3 TheMDR Approach 211 4 A Formal Complement to the 213 Approach 213 5 Conclusion 214 References 215 Rule Revision in Normal DL Logic Programs 216 1 Introduction 216 2 Preliminaries 217 3 Three-Valued Semantics for Normal DL Logic Programs 218 4 Rule Revision in Normal DL Logic Programs 219 5 Conclusion 221 References 221 OBDA and Intermodal Logistics: Active Projects and Applications 222 1 Context and Motivation 222 2 Active Projects 223 3 OBDA and Intermodal Logistics 224 4 Conclusions 226 References 226 Semantic Pervasive Advertising 228 1 Introduction 228 2 Related Work 229 3 The PervADs Approach 230 References 233 Semantics for Mapping Relations in SKOS 235 1 SKOSModels 235 2 SKOS Modeling Conventions 237 3 ModelRestriction 237 4 Conservative Mappings 238 5 Structure Preserving Mappings 239 References 240 From OWL to DL-Lite through Efficient Ontology Approximation 241 1 Introduction 241 2 Approximation of DL Ontologies 242 3 Approximation in DL-LiteA of OWL 2 Ontologies 243 4 Conclusion 246 References 246 PQMPMS: A Preference-enabled Querying Mechanism for Personalized Mobile Search 247 1 Introduction 247 2 Related Work 248 3 Architecture and Components 249 4 Evaluation 251 5 Conclusions and Future Work 252 References 252 Kiabora: An Analyzer of Existential Rule Bases 253 1 Introduction 253 2 Preliminaries 254 3 Decidability Properties 255 4 Kiabora 256 5 Perspectives 258 References 258 StreamRule: A Nonmonotonic Stream Reasoning System for the Semantic Web 259 1 Introduction and Motivation 259 2 System Design and Implementation 261 3 Related Work 262 4 Experiments and Discussion 262 References 263 An Integrated Environment for Reasoning over Ontologies via Logic Programming 265 Introduction 265 1 Integrating ASPIDE and prot ́eg ́e 266 2 Some Use Cases 267 References 270 Horn-DL: An Expressive Horn Description Logic with PTime Data Complexity 271 1 Introduction 271 2 Horn-DL 272 2.1 Syntax of RBoxes 273 2.2 Syntax of Concepts and TBoxes 273 2.3 Syntax of ABoxes and Knowledge Bases 274 2.4 Data Complexity 274 3 Comparing Horn-DL with Horn- 275 References 276 Parameter Learning for Probabilistic Ontologies 277 1 Introduction 277 2 Description Logics and the DISPONTE Semantics 278 3 EDGE 279 4 Related Work 280 5 Experiments 281 6 Conclusions 282 References 282 Author Index 283 Front Matter....Pages - Inconsistency Management for Description Logic Programs and Beyond....Pages 1-3 Reasoning About Pattern-Based XML Queries....Pages 4-18 Answer Set Programming: Language, Applications and Development Tools....Pages 19-34 A Variant of Earley Deduction with Partial Evaluation....Pages 35-49 Verification and Synthesis in Description Logic Based Dynamic Systems....Pages 50-64 Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas....Pages 65-79 Computing Incoherence Explanations for Learned Ontologies....Pages 80-94 An Ontology-Based Reasoning Approach for Electric Power Utilities....Pages 95-108 Conjunctive Queries with Negation over DL-Lite: A Closer Look....Pages 109-122 On the Exploration of the Query Rewriting Space with Existential Rules....Pages 123-137 Incomplete Information in RDF....Pages 138-152 RIO: Minimizing User Interaction in Ontology Debugging....Pages 153-167 Eliminating Nonmonotonic DL-Atoms in Description Logic Programs....Pages 168-182 BUNDLE: A Reasoner for Probabilistic Ontologies....Pages 183-197 Detection of Inconsistencies in Rules Due to Changes in Ontologies: Let’s Get Formal....Pages 198-203 Rule Revision in Normal DL Logic Programs....Pages 204-209 OBDA and Intermodal Logistics: Active Projects and Applications....Pages 210-215 Semantic Pervasive Advertising....Pages 216-222 Semantics for Mapping Relations in SKOS....Pages 223-228 From OWL to DL − Lite through Efficient Ontology Approximation....Pages 229-234 PQMPMS: A Preference-enabled Querying Mechanism for Personalized Mobile Search....Pages 235-240 Kiabora: An Analyzer of Existential Rule Bases....Pages 241-246 StreamRule: A Nonmonotonic Stream Reasoning System for the Semantic Web....Pages 247-252 An Integrated Environment for Reasoning over Ontologies via Logic Programming....Pages 253-258 HornDL: An Expressive Horn Description Logic with PTime Data Complexity....Pages 259-264 Parameter Learning for Probabilistic Ontologies....Pages 265-270 Back Matter....Pages -