دانلود کتاب Rules and Reasoning. 6th International Joint Conference on Rules and Reasoning, RuleML+RR 2022 Berlin, Germany, September 26–28, 2022 Proceedings

فهرست مطالب :

Preface
Organization
Contents
Answer Set Programming
Applying Answer Set Optimization to Preventive Maintenance Scheduling for Rotating Machinery
1 Introduction
2 Definitions of Machines and Schedules
3 Basic PMS Problems and Their Complexities
4 An ASO-Based Implementation
5 Experiments
6 Conclusion
References
On the Generalization of Learned Constraints for ASP Solving in Temporal Domains
1 Introduction
2 Background
3 Temporal Programs, Problems and Nogoods
4 Generalizing Learned Constraints
5 Translations
6 Experiments
7 Conclusion
References
The Stream Reasoning System I-DLV-sr: Enhancements and Applications in Smart Cities
1 Introduction
2 The I-DLV-sr System
3 Re-engineering the System and Improving Performance
3.1 Performance Evaluation
4 New Language Features
5 Stream Reasoning via I-DLV-sr in Smart City Scenarios
5.1 Modeling Smart City Applications with I-DLV-sr
5.2 Performance Evaluation
6 Related Work
7 Conclusions
References
Plingo: A System for Probabilistic Reasoning in Clingo Based on LPMLN
1 Introduction
2 Background
3 LPMLN and the Language of Plingo
4 The System Plingo
5 Experiments
6 Conclusion
References
Foundations of Nonmonotonic Reasoning
From Defeasible Logic to Counterfactual Reasoning
1 Introduction
2 Defeasible Logic
3 Counterfactuals
4 Counterfactuals in Defeasible Logic: Fact Revision
4.1 Preliminaries
4.2 Mapping SDL into Counterfactuals - Part I
5 Counterfactuals in Defeasible Logic: Theory Revision
5.1 Revising Defeasible Theories
5.2 Mapping SDL into Counterfactuals - Part II
6 Results
7 Conclusions
References
KLM-Style Defeasibility for Restricted First-Order Logic
1 Introduction
2 Background
3 Defeasible Restricted First-Order Logic
4 Defeasible Entailment
5 Related Work
6 Conclusion and Future Work
References
Semantic Characterizations of AGM Revision for Tarskian Logics
1 Introduction
2 Preliminaries
2.1 Logics with Classical Model-Theoretic Semantics
2.2 Relations over Interpretations
2.3 Bases
2.4 Base Change Operators
2.5 Postulates for Revision
3 Base Revision in Propositional Logic
4 Approach for Arbitrary Base Logics
4.1 First Problem: Non-existence of Minima
4.2 Second Problem: Transitivity of Preorder
5 One-way Representation Theorem
6 Two-way Representation Theorem
7 Total-Preorder-Representability
8 Related Work
9 Conclusion
References
Datalog
iWarded: A Versatile Generator to Benchmark Warded Datalog+/– Reasoning
1 Introduction
2 Syntax and Semantics of Warded Datalog
3 iWarded System
3.1 Overview of the Generator
3.2 Benchmark Generation Procedure
4 Experimental Evaluation
5 Related Work
6 Conclusion
References
The Temporal Vadalog System
1 Introduction
2 DatalogMTL
3 The Temporal Vadalog System
3.1 A Time-Aware Execution Pipeline
3.2 Temporal Operators in the Execution Pipeline
3.3 Merging Strategies
3.4 Temporal Joins and Stratified Negation
3.5 Termination Strategy for the Infinite Chase of Intervals
3.6 Combining Temporal and Non-Temporal Reasoning
4 Experiments
4.1 Experiments with Realistic and Real-World Data
4.2 Temporal Foundation Benchmark
5 Related Work
6 Conclusion
References
An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog
1 Introduction
2 Preliminaries
3 Rule-Based Provenance On-Demand
4 Realization as Solutions to Systems of Equations
5 Realization with Datalog(S)
5.1 Datalog with Sets
5.2 Collecting Sets from Downward Closures
6 Implementation and Experimental Results
6.1 Feasibility of the On-Demand Approach to Why-Provenance
6.2 Performance of Why-Provenance Computation
7 Related Work
8 Conclusions
References
Queries Over Ontologies
Explaining Ontology-Mediated Query Answers Using Proofs over Universal Models
1 Introduction
2 Preliminaries
3 A Deriver Using Universal Models
4 Finding Good Proofs in D sk
4.1 The Data Complexity of Finding Good Proofs
4.2 Finding Good Proofs with Lightweight Ontologies
4.3 Finding Good Proofs with Expressive Ontologies
5 Directly Deriving CQs
6 Conclusion
References
Seminaïve Materialisation in DatalogMTL
1 Introduction
2 Preliminaries
3 Naïve Materialisation in DatalogMTL
4 Seminaïve Evaluation
5 Optimised Seminaïve Evaluation
6 Evaluation
7 Conclusion and Future Work
References
Magic Sets in Interpolation-Based Rule Driven Query Optimization
1 Introduction
2 Preliminaries and Definitions
3 MST and Rule Rewriting
4 Conclusion
References
Proofs, Error-Tolerance, and Rules
In the Head of the Beholder: Comparing Different Proof Representations
1 Introduction
2 Background
3 Study I – Are Short Proofs Preferred?
4 Study II – Connecting Cognitive Abilities and Proof Understanding
5 Study III – Logical Abilities and Proof Representation Preferences
6 Study IV – Final Experiment
7 General Discussion
7.1 Limitations
7.2 Future Work
References
Error-Tolerant Reasoning in the Description Logic EL Based on Optimal Repairs
1 Introduction
2 Preliminaries
3 Optimal and Canonical Repairs
4 Error-Tolerant Reasoning w.r.t. Optimal Repairs
4.1 Brave Entailment
4.2 Cautious Entailment
5 Conclusion
References
Bridging Between LegalRuleML and TPTP for Automated Normative Reasoning
1 Introduction
2 Preliminaries
2.1 The TPTP Infrastructure for ATP Systems
2.2 Deontic Logics and LegalRuleML
2.3 Domain-Specific Languages
3 Logical Pluralism in Normative Reasoning
3.1 The Problem of Formalization
3.2 Formalizing Normative Discourse
4 Normative Knowledge Representation in the TPTP
4.1 NMF: A Normative DSL in TPTP
4.2 Conversion from LegalRuleML to NMF
5 TPTP-Based Normative Reasoning Backends
6 Conclusion
References
Agents and Argumentation
A Rule-Based Behaviour Planner for Autonomous Driving
1 Introduction
2 Rule Engine
2.1 Layers and Rules
2.2 Resolving a Single Behaviour
2.3 Inference Example
3 Learning and Maintaining the Theory
3.1 Rule Engine Update Algorithm
3.2 Rule and Training Set Development
4 Experimental Results
4.1 Driving Policy
4.2 Field Test
5 Conclusion
References
Cooperation Among Groups of Agents in the Epistemic Logic L-DINF
1 Introduction
2 Logical Framework
2.1 Syntax
2.2 Semantics
2.3 Belief Update
2.4 Axiomatization
3 Problem Specification and Inference: An Example
4 Canonical Model and Strong Completeness
5 Conclusions
References
Prudens: An Argumentation-Based Language for Cognitive Assistants
1 Introduction
2 Basic Syntax and Semantics
2.1 Rule Syntax
2.2 Reasoning
2.3 Custom Priorities and Dilemmas
3 Extended Syntax and Semantics
3.1 The Unification Predicate
3.2 On-the-Fly Math Operations
3.3 Procedural Predicates
3.4 Partially Grounded Contexts
3.5 Extended Conflict Semantics
4 Ongoing and Future Work
4.1 Deduction, Induction and Abduction
4.2 Natural Language Interfaces
4.3 Applications
5 Conclusions
References
Author Index