Temporal Minimal-World Query Answering over Sparse ABoxes

DOI10.1017/s1471068421000119zbMath1530.68250arXiv2105.14369MaRDI QIDQ6063880

Stefan Borgwardt, Alisa Kovtunova, Walter Forkel

Publication date: 12 December 2023

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.14369

zbMATH Keywords

knowledge representationnonmonotonic reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Unnamed Item
• Data complexity of query answering in description logics
• Data exchange: semantics and query answering
• First order common knowledge logics
• Metric temporal description logics with interval-rigid names
• Core-like properties of infinite graphs and structures
• Closed-world semantics for conjunctive queries with negation over \(\mathcal{ELH}_\bot\) ontologies
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• Monitoring Metric First-Order Temporal Properties
• Temporal Query Answering in the Description Logic DL-Lite
• LTL over description logic axioms
• A Cookbook for Temporal Conceptual Data Modelling with Description Logics
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• An Introduction to Description Logic
• A really temporal logic
• The benefits of relaxing punctuality
• On metric temporal description logics
• Querying Log Data with Metric Temporal Logic
• Temporalizing Ontology-Based Data Access
• The Description Logic Handbook
• Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
• First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

This page was built for publication: Temporal Minimal-World Query Answering over Sparse ABoxes