Search

• < Previous
• 1
• Next >

---

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests

Bart Bogaerts ; Maxime Jakubowski ; Jan Van den Bussche.

SHACL is a W3C-proposed schema language for expressing structural constraints on RDF graphs. Recent work on formalizing this language has revealed a striking relationship to description logics. SHACL expressions can use three fundamental features that are not so common in description logics. These&nbsp;[&hellip;]

---

Executable First-Order Queries in the Logic of Information Flows

Heba Aamer ; Bart Bogaerts ; Dimitri Surinx ; Eugenia Ternovska ; Jan Van den Bussche.

The logic of information flows (LIF) has recently been proposed as a general framework in the field of knowledge representation. In this framework, tasks of procedural nature can still be modeled in a declarative, logic-based fashion. In this paper, we focus on the task of query processing under&nbsp;[&hellip;]

---

Preservation theorems for Tarski's relation algebra

Bart Bogaerts ; Balder ten Cate ; Brett McLean ; Jan Van den Bussche.

We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain several positive and negative results along these lines.&nbsp;[&hellip;]

---