default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Stéphan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j11]Laurent Garcia, Claire Lefèvre, Igor Stéphan, Odile Papini, Éric Würbel:
A Semantic Characterization ASP Base Revision. J. Artif. Intell. Res. 66: 989-1029 (2019)- 2018
- [j10]Jean-François Baget, Laurent Garcia
, Fabien Garreau, Claire Lefèvre, Swan Rocher, Igor Stéphan:
Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin. Ann. Math. Artif. Intell. 82(1-3): 3-41 (2018) - [j9]Fabien Garreau, Laurent Garcia, Claire Lefèvre, Igor Stéphan:
Answer Set Programming et interrogation. Rev. d'Intelligence Artif. 32(5-6): 555-602 (2018) - 2017
- [j8]Vincent Barichard, Igor Stéphan:
Le problème de satisfaction de contraintes quantifiées et les jeux à deux joueurs à horizon fini : le projet QuaCode. Rev. d'Intelligence Artif. 31(3): 337-365 (2017) - [j7]Claire Lefèvre, Christopher Béatrix, Igor Stéphan, Laurent Garcia:
ASPeRiX, a first-order forward chaining approach for answer set computing. Theory Pract. Log. Program. 17(3): 266-310 (2017) - 2012
- [j6]Béatrice Duval, Laurent Garcia, Claire Lefèvre, Igor Stéphan:
Les travaux de Pascal Nicolas. Interrogation, induction et déduction automatiques pour le raisonnement non monotone... et plus encore. Rev. d'Intelligence Artif. 26(1-2): 11-38 (2012) - [j5]Igor Stéphan:
Un panorama sur les procédures de décision séquentielles pour le problème de validité des formules booléennes quantifiées. Rev. d'Intelligence Artif. 26(1-2): 163-196 (2012) - 2009
- [j4]Igor Stéphan, Benoit Da Mota, Pascal Nicolas:
From (Quantified) Boolean Formulae to Answer Set Programming. J. Log. Comput. 19(4): 565-590 (2009) - 2006
- [j3]Pascal Nicolas, Laurent Garcia, Igor Stéphan, Claire Lefèvre:
Possibilistic uncertainty handling for answer set programming. Ann. Math. Artif. Intell. 47(1-2): 139-181 (2006) - 2002
- [j2]Frédéric Saubion, Igor Stéphan:
A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars. Discret. Math. Theor. Comput. Sci. 5(1): 227-262 (2002) - 2001
- [j1]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
Heuristics for a Default Logic Reasoning System. Int. J. Artif. Intell. Tools 10(4): 503-523 (2001)
Conference and Workshop Papers
- 2024
- [c30]Pedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub, Igor Stéphan:
A Fixpoint Characterisation of Temporal Equilibrium Logic. LPNMR 2024: 304-316 - 2022
- [c29]Igor Stéphan, Vincent Barichard:
Une sémantique opérationnelle pour les QCHR. JIAF 2022: 110-119 - 2021
- [c28]Igor Stéphan:
First-order ASP programs as CHR programs. SAC 2021: 881-888 - 2019
- [c27]Mohamed Ben Ellefi, Pierre Drap, Laurent Garcia, Fabien Garreau, Claire Lefèvre, Odile Papini, Igor Stéphan, Éric Würbel:
Query Answering With Non-Monotonic Rules: A Case Study of Archaeology Qualitative Spatial Reasoning. GCAI 2019: 94-107 - [c26]Vincent Barichard, Igor Stéphan:
Quantified Constraint Handling Rules. ICLP Technical Communications 2019: 210-223 - 2018
- [c25]Igor Stéphan:
A New Proof-Theoretical Linear Semantics for CHR. ICLP (Technical Communications) 2018: 4:1-4:17 - [c24]Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stéphan, Éric Würbel:
Possibilistic ASP Base Revision by Certain Input. IJCAI 2018: 1824-1830 - 2017
- [c23]Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stéphan, Éric Würbel:
A Semantic Characterization for ASP Base Revision. SUM 2017: 334-347 - 2016
- [c22]Christopher Béatrix, Claire Lefèvre, Laurent Garcia, Igor Stéphan:
Justifications and Blocking Sets in a Rule-Based Answer Set Computation. ICLP (Technical Communications) 2016: 6:1-6:15 - 2015
- [c21]Fabien Garreau, Laurent Garcia, Claire Lefèvre, Igor Stéphan:
∃-ASP. JOWO@IJCAI 2015 - 2014
- [c20]Igor Stéphan:
Functional Semantics for Non-prenex QBF. ICAART (1) 2014: 358-365 - [c19]Vincent Barichard, Igor Stéphan:
The Cut Tool for QCSP. ICTAI 2014: 883-890 - 2010
- [c18]Benoit Da Mota, Pascal Nicolas, Igor Stéphan:
A new parallel architecture for QBF tools. HPCS 2010: 324-330 - 2009
- [c17]Igor Stéphan, Benoit Da Mota:
A Unified Framework for Certificate and Compilation for QBF. ICLA 2009: 210-223 - 2006
- [c16]Igor Stéphan:
Boolean Propagation Based on Literals for Quantified Boolean Formulae. ECAI 2006: 452-456 - 2005
- [c15]Pascal Nicolas, Laurent Garcia, Igor Stéphan:
A Possibilistic Inconsistency Handling in Answer Set Programming. ECSQARU 2005: 402-414 - [c14]Pascal Nicolas, Laurent Garcia, Igor Stéphan:
Possibilistic Stable Models. IJCAI 2005: 248-253 - 2004
- [c13]Pascal Nicolas, Laurent Garcia, Igor Stéphan:
Programmation par ensembles-réponses possibilistes. JFPLC 2004 - [c12]Pascal Nicolas, Laurent Garcia, Igor Stéphan:
A possibilistic approach to restore consistency in answer set programming. NMR 2004: 306-312 - 2002
- [c11]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
Answer Set Programming by Ant Colony Optimization. JELIA 2002: 481-492 - [c10]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
Optimisation par colonies de fourmis pour la programmation logique étendue. JFPLC 2002: 57- - 2001
- [c9]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
Genes and Ants for Default Logic. Answer Set Programming 2001 - [c8]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
New Generation Systems for Non-monotonic Reasoning. LPNMR 2001: 309-321 - 2000
- [c7]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
GADEL: a Genetic Algorithm to Compute Default Logic Extensions. ECAI 2000: 484-490 - [c6]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
Combining heuristics for default logic reasoning systems. ICTAI 2000: 393-400 - 1999
- [c5]Frédéric Saubion, Igor Stéphan:
Implanter des langages d'arbres en Prolog. JFPLC 1999: 89-106 - [c4]Frédéric Saubion, Igor Stéphan:
On Implementation of Tree Synchronized Languages. RTA 1999: 382-396 - 1998
- [c3]Igor Stéphan:
A New Abstract Logic Programming Language and Its Quantifier Elimination Method for Disjunctive Logic Programming. AIMSA 1998: 403-416 - 1994
- [c2]Igor Stéphan:
Du ou dans les arbres. JFPLC 1994: 93-108 - 1992
- [c1]Igor Stéphan:
L'inheritance near-Horn Prolog en Prolog. JFPL 1992: 403-419
Parts in Books or Collections
- 2020
- [p1]Arnaud Lallouet, Yves Moinard, Pascal Nicolas, Igor Stéphan:
Logic Programming. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 83-113
Informal and Other Publications
- 2015
- [i5]Claire Lefèvre, Christopher Béatrix, Igor Stéphan, Laurent Garcia:
ASPeRiX, a First Order Forward Chaining Approach for Answer Set Computing. CoRR abs/1503.07717 (2015) - 2013
- [i4]Igor Stéphan:
Compilation for QCSP. CoRR abs/1307.4655 (2013) - 2005
- [i3]Pascal Nicolas, Laurent Garcia, Igor Stéphan:
Possibilistic Stable Models. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 - 2000
- [i2]Pascal Nicolas, Frédéric Saubion, Igor Stéphan:
Genetic Algorithms for Extension Search in Default Logic. CoRR cs.AI/0002015 (2000) - [i1]Igor Stéphan, Frédéric Saubion, Pascal Nicolas:
Description of GADEL. CoRR cs.AI/0003018 (2000)
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-04 21:41 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:
