Sociable robots are embodied agents that are part of a heterogeneous society of robots and humans. They should be able to recognize human beings and each other, and to engage in social interactions. The use of a robotic architecture may strongly reduce ...

Because of their convincing performance, there is a growing interest in using evolutionary algorithms for reinforcement learning. We propose learning of neural network policies by the covariance matrix adaptation evolution strategy (CMA-ES), a ...

This paper presents a novel Information Extraction system able to generate complex instances from free text available on the Web. The approach is based on a non-monotonical processing over ontologies, and makes use of entity recognizers and ...

The existence of huge volumes of documents written in multiple languages on Internet leads to investigate novel algorithmic approaches to deal with information of this kind. However, most crosslingual natural language processing (NLP) tasks consider a ...

The research community has long recognized the study of non-monotonic reasoning (NMR) as a promising approach to model features of commonsense reasoning. We study one of the semantics that are useful to formalize NMR, called the p-stable semantics. We ...

In this paper, we extend our previous work on Resourced ASP, or for short RASP, where we have introduced the possibility of defining and using resources in ASP. In RASP, one can define resources with their amounts, where available resources can be used ...

Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how biological systems function. The tile assembly model is a highly ...

This paper develops connections between objective Bayesian epistemology-which holds that the strengths of an agent's beliefs should be representable by probabilities, should be calibrated with evidence of empirical probability, and should otherwise be ...

Variable ordering heuristics that sample information before or during search in order to inform subsequent decisions have shown better performance and greater robustness than standard heuristics. One such strategy, the ''weighted degree heuristic,'' is ...

Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application of MMUCAs by: (1) providing an algorithm to generate artificial data that ...

The evolution of SAT algorithms over the last decade has motivated the application of SAT to model checking, initially through the use of SAT in bounded model checking and, more recently, in unbounded model checking. This paper provides an overview of ...

DLV is the state-of-the-art system for evaluating disjunctive answer set programs. As in most Answer Set Programming (ASP) systems, its implementation is divided in a grounding part and a propositional model-finding part. In this paper, we focus on the ...

The techniques for making decisions (branching) play a central role in complete methods for solving structured instances of propositional satisfiability (SAT). Experimental case studies in specific problem domains have shown that in some cases SAT ...

Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researchers to perform association studies for the ...

In the last few years, microprocessor technologies have been moving towards multi-core architectures, in order to improve performance as well as reduce power consumption. This makes real Symmetric MultiProcessing (SMP) available even on non-dedicated ...

In this paper a new graph based representation of Boolean formulas in conjunctive normal form (CNF) is proposed. It extends the well-known graph representation of binary CNF formulas (2-SAT) to the general case. Every clause is represented as a set of (...

Most of the normal forms for fuzzy logics are versions of conjunctive and disjunctive classical normal forms. Unfortunately, they do not always preserve tautologies and contradictions which is important, for example, for automated theorem provers based ...

By means of several examples of structural operational semantics for a variety of languages, we justify the importance and interest of using the notions of strategies and simulations in the semantic framework provided by rewriting logic and implemented ...