Sylvain Lagrue - Academia.edu (original) (raw)

Related Authors

Hakim Fadili

Hakim Fadili

Ecole Nationale des Sciences Appliquées de Fès (ENSAF)

BOUDHIR Anouar

Jana  Javornik

Uploads

Papers by Sylvain Lagrue

Research paper thumbnail of Belief change: a brief overview

Research paper thumbnail of A Lexicographic Inference for Partially Preordered Belief Bases

Kr, 2008

Coherence-based approaches are quite popular to reason under inconsistency. Most of them are defi... more Coherence-based approaches are quite popular to reason under inconsistency. Most of them are defined with respect to totally preordered belief bases such as the lexicographic inference which is known to have desirable properties from theoretical, practical and psychological points of view. However, partially preordered belief bases offer much more flexibility to represent efficiently incomplete knowledge and to avoid comparing unrelated pieces of information. In this paper, we propose a lexicographic inference for partially preordered belief bases that extends the classical one. On one hand, we define a natural inference relation which consists in applying classical lexicographic inference from all compatible totally preordered belief bases. On the other hand, we propose a novel cardinality-based preorder between consistent subbases. This cardinality-based preorder can be indifferently applied on partially or totally preordered belief bases. Then, applying classical inference on the preferred consistent subbases, according to this preorder, provides another lexicographic inference relation for partially preordered belief bases. Interestingly enough, we show that these two inference relations are equivalent. Lastly, a semantic characterization of these two equivalent definitions is provided.

Research paper thumbnail of Pondérations, collisions et préservation de la majorité en logique des pénalités

Information Interaction Intelligence, 2009

Research paper thumbnail of Incomparabilité et incommensurabilité dans le raisonnement et la dynamique des croyances

Research paper thumbnail of Revision of Partially Ordered Information: Axiomatization, Semantics and Iteration

International Joint Conference on Artificial Intelligence, 2005

This paper deals with iterated revision of partially ordered information. The rst part of this pa... more This paper deals with iterated revision of partially ordered information. The rst part of this paper concerns the Katsuno-Mendelzon's postulates: we rst point out that these postulates are not fully sat- isfactory since only a class of partially ordered in- formation can be revised. We then propose a suit- able denition of faithful assignment, followed by a new set of

Research paper thumbnail of Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning

Lecture Notes in Computer Science, 2004

This paper presents an application that aims at identifying optimal locations based on partially ... more This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that allows the management of partially ordered constraints and a Geographical Information System (GIS) allowing spatial data mapping and analysis. Experts in urban planning provides constraints, being in our application a combination of legal constraints and preferences expressed by the property developer. As these constraints can hardly be totally ordered because they are not comparable, constraints are partially ordered. The experiment was performed using about 3800 cadastral parcels and 12 different constraints, each parcel being characterised for each constraint using GIS analysis operators. Data are then processed by the program mpropre (Managing PaRtially Ordered PREferences) that provides in output one or several optimal parcels. Results are finally validated by an expert and using ortho-images of the geographic area of interest.

Research paper thumbnail of Min-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases

Lecture Notes in Computer Science, 2014

Research paper thumbnail of Determination and evaluation of efficient strategies for a stop or roll dice game: Heckmeck am Bratwurmeck (Pickomino)

2008 IEEE Symposium On Computational Intelligence and Games, 2008

This paper deals with a nondeterministic dice-based game: Heckmeck am Bratwurmeck (Pickomino). Th... more This paper deals with a nondeterministic dice-based game: Heckmeck am Bratwurmeck (Pickomino). This game is based on dice rolling and on the stop or roll principle. To decide between going on rolling or stopping a player has to estimate his chances of improving his score and of losing. To do so he takes into account the previous dice rolls and evaluates the risk for the next ones.

Research paper thumbnail of Belief Revision of GIS Systems: the Results of

Abstract. This paper presents a synthesis of works performed on the practical tractability of rev... more Abstract. This paper presents a synthesis of works performed on the practical tractability of revision on geographic information within the european REV! GIS project6. It surveys different representations of the revision problem as well as different implementations of ...

Research paper thumbnail of Logique Possibiliste à Intervalles

Research paper thumbnail of Pondérations et collisions en logique des pénalités

Research paper thumbnail of Fusion de bases de croyances possibilistes à intervalles

Research paper thumbnail of Detecting cheating activities in online duplicate Bridge game tournaments: first results

Research paper thumbnail of Traduction de jeuxa information incertaine en réseaux de contraintes stochastiques

Research paper thumbnail of Un logiciel permettant d’apprendre des règles et leurs exceptions: Area

Research paper thumbnail of Pondérations, collisions et préservation de la majorité en logique des pénalités

Research paper thumbnail of Nao joue à Motus

Research paper thumbnail of Interval-Based Possibilistic Networks

Research paper thumbnail of Compiling Strategic Games with Complete Information into Stochastic CSPs

Research paper thumbnail of Évaluation d’algorithmes de type Monte-Carlo pour Pickomino

Research paper thumbnail of Belief change: a brief overview

Research paper thumbnail of A Lexicographic Inference for Partially Preordered Belief Bases

Kr, 2008

Coherence-based approaches are quite popular to reason under inconsistency. Most of them are defi... more Coherence-based approaches are quite popular to reason under inconsistency. Most of them are defined with respect to totally preordered belief bases such as the lexicographic inference which is known to have desirable properties from theoretical, practical and psychological points of view. However, partially preordered belief bases offer much more flexibility to represent efficiently incomplete knowledge and to avoid comparing unrelated pieces of information. In this paper, we propose a lexicographic inference for partially preordered belief bases that extends the classical one. On one hand, we define a natural inference relation which consists in applying classical lexicographic inference from all compatible totally preordered belief bases. On the other hand, we propose a novel cardinality-based preorder between consistent subbases. This cardinality-based preorder can be indifferently applied on partially or totally preordered belief bases. Then, applying classical inference on the preferred consistent subbases, according to this preorder, provides another lexicographic inference relation for partially preordered belief bases. Interestingly enough, we show that these two inference relations are equivalent. Lastly, a semantic characterization of these two equivalent definitions is provided.

Research paper thumbnail of Pondérations, collisions et préservation de la majorité en logique des pénalités

Information Interaction Intelligence, 2009

Research paper thumbnail of Incomparabilité et incommensurabilité dans le raisonnement et la dynamique des croyances

Research paper thumbnail of Revision of Partially Ordered Information: Axiomatization, Semantics and Iteration

International Joint Conference on Artificial Intelligence, 2005

This paper deals with iterated revision of partially ordered information. The rst part of this pa... more This paper deals with iterated revision of partially ordered information. The rst part of this paper concerns the Katsuno-Mendelzon's postulates: we rst point out that these postulates are not fully sat- isfactory since only a class of partially ordered in- formation can be revised. We then propose a suit- able denition of faithful assignment, followed by a new set of

Research paper thumbnail of Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning

Lecture Notes in Computer Science, 2004

This paper presents an application that aims at identifying optimal locations based on partially ... more This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that allows the management of partially ordered constraints and a Geographical Information System (GIS) allowing spatial data mapping and analysis. Experts in urban planning provides constraints, being in our application a combination of legal constraints and preferences expressed by the property developer. As these constraints can hardly be totally ordered because they are not comparable, constraints are partially ordered. The experiment was performed using about 3800 cadastral parcels and 12 different constraints, each parcel being characterised for each constraint using GIS analysis operators. Data are then processed by the program mpropre (Managing PaRtially Ordered PREferences) that provides in output one or several optimal parcels. Results are finally validated by an expert and using ortho-images of the geographic area of interest.

Research paper thumbnail of Min-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases

Lecture Notes in Computer Science, 2014

Research paper thumbnail of Determination and evaluation of efficient strategies for a stop or roll dice game: Heckmeck am Bratwurmeck (Pickomino)

2008 IEEE Symposium On Computational Intelligence and Games, 2008

This paper deals with a nondeterministic dice-based game: Heckmeck am Bratwurmeck (Pickomino). Th... more This paper deals with a nondeterministic dice-based game: Heckmeck am Bratwurmeck (Pickomino). This game is based on dice rolling and on the stop or roll principle. To decide between going on rolling or stopping a player has to estimate his chances of improving his score and of losing. To do so he takes into account the previous dice rolls and evaluates the risk for the next ones.

Research paper thumbnail of Belief Revision of GIS Systems: the Results of

Abstract. This paper presents a synthesis of works performed on the practical tractability of rev... more Abstract. This paper presents a synthesis of works performed on the practical tractability of revision on geographic information within the european REV! GIS project6. It surveys different representations of the revision problem as well as different implementations of ...

Research paper thumbnail of Logique Possibiliste à Intervalles

Research paper thumbnail of Pondérations et collisions en logique des pénalités

Research paper thumbnail of Fusion de bases de croyances possibilistes à intervalles

Research paper thumbnail of Detecting cheating activities in online duplicate Bridge game tournaments: first results

Research paper thumbnail of Traduction de jeuxa information incertaine en réseaux de contraintes stochastiques

Research paper thumbnail of Un logiciel permettant d’apprendre des règles et leurs exceptions: Area

Research paper thumbnail of Pondérations, collisions et préservation de la majorité en logique des pénalités

Research paper thumbnail of Nao joue à Motus

Research paper thumbnail of Interval-Based Possibilistic Networks

Research paper thumbnail of Compiling Strategic Games with Complete Information into Stochastic CSPs

Research paper thumbnail of Évaluation d’algorithmes de type Monte-Carlo pour Pickomino

Log In