We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Q...
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
We implement the extension of the logical consequence relation to a partial order ⤠on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deļ...
Abstract. Recently it was shown that existing general-purpose inductive logic programming systems are useful for learning wrappers (known as L-wrappers) to extract data from HTML d...
In the reļ¬nement calculus, monotonic predicate transformers are used to model speciļ¬cations for (imperative) programs. Together with a natural notion of simulation, they form a...