arXiv AI
Jul 24
A New Well-Supported Semantics for Description Logic Programs
arXiv:2607. 21203v1 Announce Type: new Abstract: Description logic programs are a powerful formalism for combining rules with ontologies.
Robustness of Constraint Automata for Description Logics with Concrete Domains
arXiv:2601. 19644v2 Announce Type: replace-cross Abstract: Decidability or complexity issues about the consistency problem for description logics with concrete domains have already been analysed with tableaux-based or type elimination methods.
Related stories
Hugging Face Trending Papers
Jul 23
A New Well-Supported Semantics for Description Logic Programs
Description logic programs are a powerful formalism for combining rules with ontologies. The well-supported semantics for description logic programs ensures that no answer sets rely on cyclic dependencies.
arXiv AI
2d ago
Rewrite Once, Validate Anywhere: Producing OWL-Aware SHACL Constraints (Extended Version)
arXiv:2608. 14104v1 Announce Type: cross Abstract: The Shapes Constraint Language (SHACL) is a W3C recommendation to express syntactic constraints, called shapes, on RDF graphs.
arXiv AI
Jun 3
Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic
arXiv:2606. 03655v1 Announce Type: new Abstract: Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al.
arXiv AI
Aug 6
A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL
arXiv:2608. 04945v1 Announce Type: cross Abstract: The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs).
arXiv AI
Aug 5
Formal Verification of Agentic Systems over Operational Data
arXiv:2608. 03609v1 Announce Type: new Abstract: Agentic systems driven by large language models (LLMs) are increasingly deployed in real-world workflows where they act on persistent operational data.
Hugging Face Trending Papers
Jun 2
Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic
Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al. applied to modal logics.
arXiv AI
Jul 21
Tractable Query Answering under Epistemic Confidentiality Policies in DL Ontologies (extended version)
arXiv:2607. 16715v1 Announce Type: new Abstract: We study Controlled Query Evaluation (CQE), a declarative approach to confidentiality-preserving data access, in the context of Description Logic (DL) ontologies, and for confidentiality policies expressed through Epistemic Dependencies (EDs).
Hugging Face Trending Papers
Jun 23
Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge. In this paper, we study the application of RC to the core and horn variants of the DL-Lite family of lightweight description logics.
arXiv AI
Aug 10
Recovering Explanations from Transformed Rule-Based Ontologies
arXiv:2608. 06399v1 Announce Type: cross Abstract: Datalog rules are often used to define ontologies over Knowledge Graphs.
Hugging Face Trending Papers
Aug 5
A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL
The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs). We focus on OMQs consisting of atomic queries over ontologies expressed in Horn-ALCHI, an expressive Description Logic that is not, in general, first-order rewritable.
arXiv AI
Jun 24
Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
arXiv:2606. 24279v1 Announce Type: new Abstract: In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge.