TACCHELLA , Armando

No description

In this paper we approach the problem of reason- ing with quantified Boolean formulas (QBFs) by combining search and resolution, and by switch- ing between them according to structural proper- ties of QBFs. We provide empirical evidence that QBFs which cannot be solved by search or resolu- tion alone, can be solved by combining them, and that...

No description

No description

Agents learning in physical domains face two problems: they must meet safety requirements because their behaviour must not cause damage to the environment, and they should learn with as few samples as possible because acquiring new data requires costly interactions. Active learning strategies reduce sampling costs, as new data are requested...

From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide about the truth of formulas given limited computational resources. In this paper, we start from the problem of computing empirical hardness markers, i.e., features that...

No description

No description

No description

No description

No description

In this paper we study the problem of engineering a robust solver for quantified Boolean formulas (QBFs), i.e., a tool that can efficiently solve formulas across different problem domains without the need for domain-specific tuning. The paper presents two main empirical results along this line of research. Our first result is the development of...

No description

The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of them based on the Davis, Logemann, Loveland procedure (DLL) for propositional satisfiability...

Ensuring safe behaviors, i.e., minimizing the probability that a control strategy yields undesirable effects, becomes crucial when robots interact with humans in semi-structured environments through adaptive control strategies. In previous papers, we contributed to propose an approach that (i) computes control policies through reinforcement...

This paper argues in favour of using formal methods to ensure safety of deployed stochastic policies learned by robots in unstructured environments. It has been demonstrated that multi-objective learning alone is not sufficient to ensure globally safe behaviours in such robots, whereas learning-specific methods yield deterministic policies...

Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable formula in conjunctive normal form (CNF) and then represented as a set of clauses. Deduction starts by inferring new clauses by resolution, and goes on until the empty...