arXiv AI
Jul 24
Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB
arXiv:2607. 21191v1 Announce Type: cross Abstract: Event-B is a formal method rooted in predicate logic and set theory.
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.
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 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.
arXiv AI
Aug 20
Syntactic Simplification of OWL Class Expressions
The paper introduces Class Expression Simplifier (CES), an algorithm that syntactically simplifies OWL class expressions in Description Logics. CES preserves formal semantics by applying rewriting rules to remove redundancies and produce simpler, equivalent expressions, resulting in more compact and human-readable representations. Experiments on two medium-sized ontologies show that CES improves reasoning efficiency and reduces verbosity, and the tool is available as an open-source Python package within OWLAPY.
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
Jun 29
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.
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.
arXiv AI
Aug 3
Stratified Negation in RDF Rules: A Correct Approach (Extended Version)
arXiv:2607. 28778v1 Announce Type: cross Abstract: Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging.
arXiv AI
Jun 30
LAMP: Lean-based Agentic framework with MCP and Proof Repair
arXiv:2606. 28841v1 Announce Type: cross Abstract: Large language models are increasingly capable of mathematical reasoning, but the proofs they generate are often unreliable and hard to verify.
arXiv AI
Sep 18
Structured Four-Stage Legal Translation: From Natural-Language Traffic Rules to PROLOG
The paper introduces Structured Four-Stage Legal Translation (S4L→Prolog), a reasoning-guided framework that converts raw traffic rules into Prolog logic by performing semantic role extraction, scene completion, logical mapping, and rule generation in a single prompt. Compared to baseline approaches (NL→Prolog and LE→Prolog), S4L achieves higher accuracy—formalizing 75 % of twenty real-world traffic rules versus 60 % and 55 % for the baselines. Qualitative analysis shows S4L better captures implicit causal relations, deontic modality, and exception structures.
arXiv AI
Jul 21
AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language
arXiv:2607. 16372v1 Announce Type: cross Abstract: Interactive theorem proving (ITP) underpins program verification and formalized mathematics, but its manual effort limits scalability.
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.