Browse Proceedings

I am delighted to have the honour to introduce the Proceedings of the Nineteenth European Conference on Artificial Intelligence (ECAI-2010), including the proceedings of the Sixth Conference on Prestigious Applications of Intelligent Systems (PAIS-2010)...

We introduce a top-down compilation algorithm for constructing structured DNNF for any Boolean function. With appropriate restrictions, the algorithm can produce various subsets of DNNF such as deterministic DNNF and OBDD. We derive a size upper bound ...

A formal notion of a Boolean-function decomposition was introduced recently and used to provide lower bounds on various representations of Boolean functions, which are subsets of decomposable negation normal form (DNNF). This notion has introduced a ...

Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreover, backbones find other applications. For example, backbones are often ...

We consider a combined satisfiability problem where an instance is given in two parts: a set of traditional clauses extended with a set of parity (xor) constraints. To solve such problems without translation to CNF, we develop a parity constraint ...

We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all minimal subsets of a given DL-Lite knowledge base that have a given ...

The deployment of KR formalisms to the Web has created the need for formalisms that combine heterogeneous knowledge bases. Nonmonotonic dl-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with ...

We investigate the expressive power and computational complexity of ELν, the extension of the lightweight description logic EL with concept constructors for greatest fixpoints. It is shown that ELν has the same expressive power as EL extended with ...

In this paper, we propose two new approaches to forgetting for ALC based on the well-known tableau algorithm. The first approach computes the result of forgetting by rolling up tableaux, and also provides a decision algorithm for the existence of ...

The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem becomes decidable. On the one hand, we abstract from the actual execution ...

In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combines the max-sum algorithm with continuous non-linear optimisation methods. We show ...

Distributed constraint optimization problems can be solved by BnB-ADOPT+, a distributed asynchronous search algorithm. In the centralized case, local consistency techniques applied to constraint optimization have been shown very beneficial to increase ...

In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As these providers typically display highly heterogeneous performance ...

In this paper we provide a formalism to reason about the problem of many hands in organisations. This is a problem that arises whenever the organisation is responsible for some undesirable outcome but none of its members can be held responsible for the ...

This article addresses collaborative concept learning in a MAS. In a concept learning problem an agent incrementally revises a hypothetical representation of some target concept to keep it consistent with the whole set of examples that it receives from ...

Learning event models from videos has applications ranging from abnormal event detection to content based video retrieval. Relational learning techniques such as Inductive Logic Programming (ILP) hold promise for building such models, but have not been ...

This paper considers the diagnosis of large discrete-event systems consisting of many components. The problem is to determine, online, all failures and states that explain a given sequence of observations. Several model-based diagnosis approaches deal ...

Diagnosability is the property of a given partially observable system model to always exhibit unambiguously a failure behavior from its only available observations in finite time after the fault occurrence, which is the basic question that underlies ...

Diagnosis of process executions is an important task in many application domains, especially in the area of workflow management systems and orchestrated Web Services. If executions fail because activities of the process do not behave as intended, ...

Extended Argumentation Frameworks (EAFs) are a recently proposed formalism that develop abstract argumentation frameworks (AFs) by allowing attacks between arguments to be attacked themselves: hence EAFs add a relationship D ⊆ X × A to the arguments (X) ...

The access to high-quality data is essential to make accurate decisions. Consequently, when a database becomes inconsistent is crucial to restore its consistency. The main approach for database consistency restoration is based on the notion of repair. ...

We suggest semirings as a mean to parametrically represent “weighted” Argumentation frameworks (AF): different kinds of preference levels related to arguments, e.g. a score representing a “fuzziness”, a “cost” or a probability level of each argument, ...

Ever since the seminal work of Searle, two components of interaction protocols have been identified: constitutive rules, defining the meaning of actions and regulative rules, defining the flow of execution, i.e. the behavior the agent should show. The ...

Tracking sentiment in the popular media has long been of interest to media analysts and pundits. With the availability of news content via online syndicated feeds, it is now possible to automate some aspects of this process. There is also great ...