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.
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation
arXiv:2003. 05746v5 Announce Type: replace-cross Abstract: In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts.
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
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).
arXiv AI
Jul 28
Answering Path Queries under Linear and Guarded Existential Rules
arXiv:2607. 22636v1 Announce Type: new Abstract: Ontology-mediated query answering is concerned with the problem of answering queries over knowledge bases consisting of a database instance and an ontology.
arXiv AI
Jun 24
Abstractions of Queries in Ontology-Based Data Access
arXiv:2606. 24618v1 Announce Type: new Abstract: In ontology-based data access (OBDA), multiple data sources are integrated via mappings to an ontology.
arXiv AI
Sep 10
Evidential-Based Higher-Order Set Argumentation Framework
The paper introduces the Evidential-Based Higher-Order Set Argumentation Framework (EHSAF), a unified formalism that extends Dung’s abstract argumentation by incorporating evidential support, higher-order relations, and collective interactions. Two complete semantics are defined: an adjacent complete labelling semantics allowing multiple truth values for arguments in support cycles, and an extension-based complete semantics that accepts only well‑founded support chains. The authors provide a propositional encoding in three‑valued Łukasiewicz logic and extend it to continuous fuzzy logics, proving key properties and showing equivalence under support‑acyclicity.
arXiv AI
Aug 17
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.
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
Jun 15
Transforming Shape Schemas with Composable Property-Graph Queries (Extended Version)
arXiv:2606. 14309v1 Announce Type: cross Abstract: Property graphs may be constrained by schemas that inform both query engines and human users about the shape of valid data, enforcing a contract between data provider and consumer.
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
Jun 18
The More the Merrier: Combining Properties for ABox Abduction under Repair Semantics for ELbot
arXiv:2606. 19197v1 Announce Type: cross Abstract: Abduction is a central approach to explain missing entailments from a knowledge base by providing a hypothesis, that would, if added to the knowledge base, make the missing entailment become true.
arXiv AI
Sep 24
A hierarchy of faithfulness criteria for knowledge base completion
The paper introduces a hierarchy of four increasingly strict faithfulness criteria—discrimination, logical admissibility, monotonic logical faithfulness, and probabilistic logical faithfulness—for evaluating knowledge base completion models, particularly when the target is a description logic knowledge base. It demonstrates that ranking accuracy alone does not guarantee logical faithfulness and shows that current embedding models fail to satisfy any of the criteria across the hierarchy. The authors provide a formal grounding for the strongest criterion using relative model counts and evaluate several models on εL ontologies, revealing gaps between performance metrics and logical correctness.