Updating logical databases
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Model checking
Modal and temporal properties of processes
Modal and temporal properties of processes
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Consistent query answering in databases
ACM SIGMOD Record
Specification and verification of data-driven Web applications
Journal of Computer and System Sciences
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Ontology change: Classification and survey
The Knowledge Engineering Review
Automatic verification of database-driven systems: a new frontier
Proceedings of the 12th International Conference on Database Theory
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
Ontologies and Databases: The DL-Lite Approach
Reasoning Web. Semantic Technologies for Information Systems
EQL-lite: effective first-order query processing in description logics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Journal on data semantics X
Inconsistency-tolerant semantics for description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Evolution of DL-lite knowledge bases
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Ontology-based governance of data-aware processes
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Verification of relational data-centric dynamic systems with external services
Proceedings of the 32nd symposium on Principles of database systems
Hi-index | 0.00 |
Description Logic Knowledge and Action Bases (KABs) have been recently introduced as a mechanism that provides a semantically rich representation of the information on the domain of interest in terms of a DL KB and a set of actions to change such information over time, possibly introducing new objects. In this setting, decidability of verification of sophisticated temporal properties over KABs, expressed in a variant of first-order µ-calculus, has been shown. However, the established framework treats inconsistency in a simplistic way, by rejecting inconsistent states produced through action execution. We address this problem by showing how inconsistency handling based on the notion of repairs can be integrated into KABs, resorting to inconsistency-tolerant semantics. In this setting, we establish decidability and complexity of verification.