A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
To ensure the re-use of domain ontologies the usual approach relies on a pivot language, e.g., Kif, intoandfromwhich the domainontologyis translated. This requires several distinc...
Abstract. Logical Bayesian Networks (LBNs) have recently been introduced as another language for knowledge based model construction of Bayesian networks, besides existing languages...
Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe...