19 citations · 51 across the 18 of their papers we have counts for
4 papers · 1 filter
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference
Tony Tan, Jan Van den Bussche, Xiaowang Zhang
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such…
On the satisfiability problem for SPARQL patterns
Xiaowang Zhang, Jan Van den Bussche, François Picalausa
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of th…
FO(C) and Related Modelling Paradigms
Bart Bogaerts, Joost Vennekens, Marc Denecker +1
Recently, C-Log was introduced as a language for modelling causal processes. Its formal semantics has been defined together with introductory examples, but the study of this langua…
Inference in the FO(C) Modelling Language
Bart Bogaerts, Joost Vennekens, Marc Denecker +1
Recently, FO(C), the integration of C-Log with classical logic, was introduced as a knowledge representation language. Up to this point, no systems exist that perform inference on…