default search action
Sylvain Lagrue
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c34]Romain Goutiere, Domitile Lourdeaux, Sylvain Lagrue:
Automated Planning for Military Airline Controller Training Scenarios. ICAART (3) 2023: 466-474 - [c33]Khaled Belahcène, Jérome Gaigne, Sylvain Lagrue:
Opérateurs totalement informatifs et ordres linéaires partitionnés en révision de croyances. JIAF 2023: 43-54 - 2022
- [c32]Khaled Belahcène, Jérome Gaigne, Sylvain Lagrue:
Fragment explicable par schémas d'arguments des affectations nécessaires dans un tri non compensatoire. JIAF 2022: 35-46 - 2021
- [c31]Nathalie Chetcuti-Sperandio, Alix Goudyme, Sylvain Lagrue, Tiago de Lima:
Checking Agent Intentions in Games. ICTAI 2021: 815-822 - 2020
- [c30]Nathalie Chetcuti-Sperandio, Alix Goudyme, Sylvain Lagrue, Tiago de Lima:
First Steps for Determining Agent Intention in Dynamic Epistemic Logic. ICAART (2) 2020: 717-724
2010 – 2019
- 2019
- [c29]Sihem Belabbes, Chi Wee Tan
, Tri-Thuc Vo, Yacine Izza, Karim Tabia, Sylvain Lagrue, Salem Benferhat:
Query Answering from Traditional Dance Videos: Case Study of Zapin Dances. ICTAI 2019: 1638-1642 - [c28]Sylvain Lagrue, Nathalie Chetcuti-Sperandio, Fabien Delorme, Ma Thi Chau, Duyen Ngo Thi, Karim Tabia, Salem Benferhat:
An Ontology Web Application-based Annotation Tool for Intangible Culture Heritage Dance Videos. SUMAC @ ACM Multimedia 2019: 75-81 - [c27]Alix Goudyme, Nathalie Chetcuti-Sperandio, Sylvain Lagrue, Tiago de Lima:
Intention et logique épistémique dynamique. RJCIA 2019: 1-9 - [c26]Sébastien Destercke
On Cautiousness and Expressiveness in Interval-Valued Logic. SUM 2019: 280-288 - 2018
- [j9]Nathalie Chetcuti-Sperandio, Fabien Delorme, Sylvain Lagrue:
On aggregate and comparison functions for Motus/Lingo playing. J. Int. Comput. Games Assoc. 40(3): 258-268 (2018) - 2017
- [j8]Frédéric Koriche, Sylvain Lagrue, Éric Piette, Sébastien Tabary:
WoodStock : un programme-joueur générique. Rev. d'Intelligence Artif. 31(3): 281-310 (2017) - [c25]Salem Benferhat, Zied Bouraoui, Ma Thi Chau, Sylvain Lagrue, Julien Rossit:
A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption. ICAART (2) 2017: 415-422 - [c24]Ma Thi Chai, Karim Tabia, Sylvain Lagrue, Le Thanh Ha, The Duy Bui, Thuy Nguyen-Thanh:
Annotating Movement Phrases in Vietnamese Folk Dance Videos. IEA/AIE (2) 2017: 3-11 - [c23]Frédéric Koriche, Sylvain Lagrue, Éric Piette
Constraint-Based Symmetry Detection in General Game Playing. IJCAI 2017: 280-287 - 2016
- [j7]Frédéric Koriche, Sylvain Lagrue, Éric Piette
General game playing with stochastic CSP. Constraints An Int. J. 21(1): 95-114 (2016) - 2015
- [c22]Salem Benferhat, Martine Ceberio, Vladik Kreinovich, Sylvain Lagrue, Karim Tabia:
On the Normalization of Interval-Based Possibility Distributions. FLAIRS 2015: 20-25 - [c21]Salem Benferhat, Zied Bouraoui, Sylvain Lagrue, Julien Rossit:
Merging Incommensurable Possibilistic DL-Lite Assertional Bases. JOWO@IJCAI 2015 - 2014
- [j6]Salem Benferhat, Sylvain Lagrue, Julien Rossit:
Sum-based weighted belief base merging: From commensurable to incommensurable framework. Int. J. Approx. Reason. 55(9): 2083-2108 (2014) - [c20]Mira Bou Farah, David Mercier, François Delmotte, Eric Lefèvre, Sylvain Lagrue:
Methods Handling Accident and Traffic Jam Information with Belief Functions in VANETs. Belief Functions 2014: 124-133 - [c19]Salem Benferhat, Sylvain Lagrue, Karim Tabia:
Analysis of interval-based possibilistic networks. ECAI 2014: 963-964 - [c18]Salem Benferhat, Zied Bouraoui, Sylvain Lagrue, Julien Rossit:
Min-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases. SUM 2014: 8-21 - [c17]Salem Benferhat, Sylvain Lagrue, Karim Tabia:
Interval-Based Possibilistic Networks. SUM 2014: 37-50 - 2012
- [c16]Salem Benferhat, Julien Hué, Sylvain Lagrue, Julien Rossit:
Merging Interval-Based Possibilistic Belief Bases. SUM 2012: 447-458 - [i2]Salem Benferhat, Sylvain Lagrue, Odile Papini:
A possibilistic handling of partially ordered information. CoRR abs/1212.2450 (2012) - 2011
- [c15]Salem Benferhat, Julien Hué, Sylvain Lagrue, Julien Rossit:
Interval-Based Possibilistic Logic. IJCAI 2011: 750-755 - 2010
- [c14]Stéphane Cardon, Nathalie Chetcuti-Sperandio, Fabien Delorme, Sylvain Lagrue:
A Markovian Process Modeling for Pickomino. Computers and Games 2010: 199-210 - [c13]Salem Benferhat, Sylvain Lagrue, Safa Yahi:
Bridging Possibilistic Conditional Knowledge Bases and Partially Ordered Bases. JELIA 2010: 38-50
2000 – 2009
- 2009
- [j5]Salem Benferhat, Sylvain Lagrue, Julien Rossit:
Max-based Prioritized Information Fusion without Commensurability. J. Log. Comput. 19(6): 1577-1610 (2009) - [c12]Salem Benferhat, Sylvain Lagrue, Julien Rossit:
An Analysis of Sum-Based Incommensurable Belief Base Merging. SUM 2009: 55-67 - 2008
- [c11]Nathalie Chetcuti-Sperandio, Fabien Delorme, Sylvain Lagrue, Denis Stackowiak:
Determination and evaluation of efficient strategies for a stop or roll dice game: Heckmeck am Bratwurmeck (Pickomino). CIG 2008: 175-182 - [c10]Nathalie Chetcuti-Sperandio, Sylvain Lagrue:
How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic. KR 2008: 340-347 - [c9]Safa Yahi, Salem Benferhat, Sylvain Lagrue, Mariette Sérayet, Odile Papini:
A Lexicographic Inference for Partially Preordered Belief Bases. KR 2008: 507-517 - 2007
- [c8]Salem Benferhat, Sylvain Lagrue, Julien Rossit:
An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints. AAAI 2007: 367-372 - [c7]Salem Benferhat, Sylvain Lagrue, Julien Rossit:
A max-based merging of incommensurable ranked belief bases based on finite scales. FUSION 2007: 1-7 - 2006
- [c6]Sylvain Lagrue, Jérémie Lussiez, Julien Rossit:
Un logiciel permettant d'apprendre des règles et leurs exceptions : Area. EGC 2006: 745-746 - 2005
- [c5]Salem Benferhat, Jonathan Ben-Naim, Robert Jeansoulin, Mahat Khelfallah, Sylvain Lagrue, Odile Papini, Nic Wilson
Belief Revision of GIS Systems: The Results of REV!GIS. ECSQARU 2005: 452-464 - [c4]Salem Benferhat, Sylvain Lagrue, Odile Papini:
Revision of Partially Ordered Information: Axiomatization, Semantics and Iteration. IJCAI 2005: 376-381 - 2004
- [j4]Salem Benferhat, Sylvain Lagrue, Odile Papini:
Reasoning with partially ordered information in a possibilistic logic framework. Fuzzy Sets Syst. 144(1): 25-41 (2004) - [j3]Salem Benferhat, Sylvain Lagrue, Odile Papini:
Belief change and pre-orders: a brief overview. Int. J. Geogr. Inf. Sci. 18(4): 353-388 (2004) - [c3]Sylvain Lagrue, Rodolphe Devillers, Jean-Yves Besqueut:
Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning. DEXA 2004: 151-160 - 2003
- [j2]Salem Benferhat, Didier Dubois, Sylvain Lagrue, Henri Prade:
A Big-Stepped Probability Approach for Discovering Default Rules. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 11(Supplement-1): 1-14 (2003) - [c2]Salem Benferhat, Sylvain Lagrue, Odile Papini:
A possibilistic handling of partially ordered information. UAI 2003: 29-36 - 2002
- [j1]Salem Benferhat, Didier Dubois, Sylvain Lagrue, Odile Papini:
Making revision reversible: an approach based on polynomials. Fundam. Informaticae 53(3-4): 251-280 (2002) - [c1]Salem Benferhat, Sylvain Lagrue, Odile Papini:
Revising partially ordered beliefs. NMR 2002: 142-149 - [i1]Salem Benferhat, Sylvain Lagrue, Odile Papini:
Revising Partially Ordered Beliefs. CoRR cs.AI/0210004 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: