490 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Institut national de recherche en sciences et technologies du numériqueFR110 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR87 papers
- Centre National de la Recherche ScientifiqueFR55 papers
- Université de LorraineFR43 papers
- Institut Élie Cartan de LorraineFR35 papers
- Université de StrasbourgFR10 papers
- École PolytechniqueFR9 papers
- Laboratoire des Sciences de l'Ingénieur, de l'Informatique et de l'ImagerieFR9 papers
- University of LuxembourgLU8 papers
- Institut de Recherche Mathématique AvancéeFR7 papers
- Centre de Mathématiques Appliquées de l'École polytechniqueFR5 papers
- Computer Algorithms for MedicineAT5 papers
11 papers · 1 filter
How to Exhibit More Predictable Behaviors
Salomé Lepers, Sophie Lemonnier, Vincent Thomas +1
This paper looks at predictability problems, i.e., wherein an agent must choose its strategy in order to optimize the predictions that an external observer could make. We address t…
Belief revision in the propositional closure of a qualitative algebra
Valmi Dufour-Lussier, Alice Hermann, Florence Le Ber +1
Belief revision is an operation that aims at modifying old be-liefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalism…
Approximate Policy Iteration Schemes: A Comparison
Bruno Scherrer
We consider the infinite-horizon discounted optimal control problem formalized by Markov Decision Processes. We focus on several approximate variations of the Policy Iteration algo…
Belief revision in the propositional closure of a qualitative algebra (extended version)
Valmi Dufour-Lussier, Alice Hermann, Florence Le Ber +1
Belief revision is an operation that aims at modifying old beliefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalisms…
Case Adaptation with Qualitative Algebras
Valmi Dufour-Lussier, Florence Le Ber, Jean Lieber +1
This paper proposes an approach for the adaptation of spatial or temporal cases in a case-based reasoning system. Qualitative algebras are used as spatial and temporal knowledge re…
On the Performance Bounds of some Policy Search Dynamic Programming Algorithms
Bruno Scherrer
We consider the infinite-horizon discounted optimal control problem formalized by Markov Decision Processes. We focus on Policy Search algorithms, that compute an approximately opt…
Automatic case acquisition from texts for process-oriented case-based reasoning
Valmi Dufour-Lussier, Florence Le Ber, Jean Lieber +1
This paper introduces a method for the automatic acquisition of a rich case representation from free text for process-oriented case-based reasoning. Case engineering is among the m…
Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps
Raghav Aras, Alain Dutech, François Charpillet
We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (N…
Case Base Mining for Adaptation Knowledge Acquisition
Mathieu D'Aquin, Fadi Badra, Sandrine Lafrogne +3
In case-based reasoning, the adaptation of a source case in order to solve the target problem is at the same time crucial and difficult to implement. The reason for this difficulty…
New results on rewrite-based satisfiability procedures
Alessandro Armando, Maria Paola Bonacina, Silvio Ranise +1
Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literal…
An Empirical Analysis of Search in GSAT
I. P. Gent, T. Walsh
We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses…