Planning in nondeterministic domains yields both conceptual and practical difficulties. From
the conceptual point of view, different notions of planning problems can be devised: for …

This paper addresses the formal verification of diagnosis systems. Given a physical system
and a diagnosis system that observes it, we tackle the problem of verifying that the diagnosis …

In this paper we tackle the problem of Conformant Planning: find a sequence of actions that
guarantees goal achievement regardless of an uncertain initial condition and of …

Abstract The introduction of Past Operators enables to produce more natural formulation of a
wide class of properties of reactive systems, compared to traditional pure future temporal …

Propositional reasoning (SAT) is central in many applications of Computer Science. Several
decision procedures for SAT have been proposed, along with optimizations and heuristics to …

LTL solvers check the satisfiability of Linear-time Temporal Logic (LTL) formulas and are
widely used for verifying and testing critical software systems. Thus, potential bugs in the …

The rapid development of the Internet of Things (IoT) has brought great changes for non-
contact and non-destructive sensing and diagnosis. For every inanimate object can tell us …

The action programming language GOLOG has been found useful for the control of
autonomous agents such as mobile robots. In scenarios like these, tasks are often open …

Fault localization is a technique that plays a valuable role in reducing the burdensome task
of hardware design code, such as Verilog or VHDL. The recent advancements in deep …

We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push
standard SAT-based approaches beyond their limits. We propose the first comprehensive …