arXiv:2607. 28778v1 Announce Type: cross Abstract: Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging.
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:2609.08271v1 Announce Type: new Abstract: In various data models, the classical triple is a typical semantic data model. However, due to the design of the triple as a simple structure for repre...
arXiv:2607. 21202v1 Announce Type: cross Abstract: Hybrid MKNF knowledge bases under the well-founded semantics integrate Description Logics with Logic Programming.
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:2607. 24551v1 Announce Type: new Abstract: Maintenance regulations are complex legal texts that are difficult to exploit when addressing a specific case and challenging to integrate into operational systems.
arXiv:2608. 06399v1 Announce Type: cross Abstract: Datalog rules are often used to define ontologies over Knowledge Graphs.
arXiv:2606. 16603v1 Announce Type: cross Abstract: LLM-based agents have demonstrated strong capabilities in data-intensive analytical tasks, yet their outputs are rarely verifiable: a reliance on linear text trajectories makes their reasoning difficult to audit.
RDFdL is a framework that merges RDF knowledge graphs with Differential Dynamic Logic (dL) to enable representation and reasoning about both static knowledge and continuous physical dynamics. It encodes differential equations and state-space ranges in RDF and SHACL, translating them into dL for formal verification. The integration allows safety and reachability proofs from dL to be queried as SPARQL entailments over RDF data, with an implementation using Apache Jena and KeYmaera X demonstrated in a manufacturing context.
Grounding, the translation of high-level theories into equivalent quantifier-free formulas, is a crucial step in declarative solving, yet it has so far escaped the proof-logging revolution. When this grounding step is not certifying, there is no way of knowing that the obtained solutions actually correspond to the original problem specification, resulting in a trust gap.
arXiv:2607. 21203v1 Announce Type: new Abstract: Description logic programs are a powerful formalism for combining rules with ontologies.
arXiv:2608.23370v1 Announce Type: new Abstract: Large Language Models (LLMs) recognise patterns but do not natively track the path of exclusions that a coherent discourse demands. When an input rests...
arXiv:2607. 21199v1 Announce Type: cross Abstract: Grounding, the translation of high-level theories into equivalent quantifier-free formulas, is a crucial step in declarative solving, yet it has so far escaped the proof-logging revolution.