Specifying and implementing dynamical systems with the situation calculus. Modeling and
implementing dynamical systems is a central problem in artificial intelligence, robotics …

CONSEQUENCE FINDING ALGORITHMS Page 1 PIERRE MARQUIS CONSEQUENCE
FINDING ALGORITHMS INTRODUCTION In this section, the notion of consequence finding is …

Hardware-based side channels are known to expose hard-to-detect security holes enabling
attackers to get a foothold into the system to perform malicious activities. Despite this fact …

Abstract Satisfaction-Driven Clause Learning (SDCL) is a recent SAT solving paradigm that
aggressively trims the search space of possible truth assignments. To determine if the SAT …

Conflict-driven clause learning (CDCL) is at the core of the success of modern SAT solvers.
In terms of propositional proof complexity, CDCL has been shown as strong as general …

High-assurance systems found in safety-critical infrastructures are facing steadily increasing
cyber threats. These critical systems require rigorous guarantees in information flow security …

Formula compilation by generation of prime implicates or implicants finds a wide range of
applications in AI. Recent work on formula compilation by prime implicate/implicant …

An improved normalization methodology enabling better optimization of SQL queries is
described. The normalization methodology effectively handles three-valued SQL search …

Legal Theory, Sources of Law and the Semantic Web is an attempt to construct an integrated
conceptual framework for the application-neutral and problem-neutral representation of …

In the last decades the interst in the problem of comparing and harmonizing legislation has
been steadily increasing. One reason is the increasing legal convergence between …