Linked e-resources
Details
Table of Contents
Intro
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
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