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.
arXiv:2608. 06399v1 Announce Type: cross Abstract: Datalog rules are often used to define ontologies over Knowledge Graphs.
arXiv:2607. 21191v1 Announce Type: cross Abstract: Event-B is a formal method rooted in predicate logic and set theory.
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:2607. 21203v1 Announce Type: new Abstract: Description logic programs are a powerful formalism for combining rules with ontologies.
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: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: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:2607. 28778v1 Announce Type: cross Abstract: Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging.
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:2607. 16372v1 Announce Type: cross Abstract: Interactive theorem proving (ITP) underpins program verification and formalized mathematics, but its manual effort limits scalability.
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: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.
Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al. applied to modal logics.