10 citations · 30 across the 15 of their papers we have counts for
4 papers · 1 filter
A Parameterized Complexity View on Description Logic Reasoning
Ronald de Haan
Description logics are knowledge representation languages that have been designed to strike a balance between expressivity and computational tractability. Many different descriptio…
Hunting for Tractable Languages for Judgment Aggregation
Ronald de Haan
Judgment aggregation is a general framework for collective decision making that can be used to model many different settings. Due to its general nature, the worst case complexity o…
Expressing Linear Orders Requires Exponential-Size DNNFs
Ronald de Haan
We show that any DNNF circuit that expresses the set of linear orders over a set of candidates must be of size . Moreover, we show that there exist DNNF circuits of s…
On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models
Ronald de Haan, Iris van de Pol
Dynamic epistemic logic (DEL) is a logical framework for representing and reasoning about knowledge change for multiple agents. An important computational task in this framework is…