L'inheritance near-Horn Prolog en Prolog. - Igor Stéphan (JFPL, 1992)

Du ou dans les arbres. - Igor Stéphan (JFPLC, 1994)

A New Abstract Logic Programming Language and Its Quantifier Elimination Method for Disjunctive Logic Programming. - Igor Stéphan (AIMSA, 1998)

Implanter des langages d'arbres en Prolog. - Frédéric Saubion; Igor Stéphan (JFPLC, 1999)

On Implementation of Tree Synchronized Languages. - Frédéric Saubion; Igor Stéphan (RTA, 1999)

GADEL: a Genetic Algorithm to Compute Default Logic Extensions. - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (ECAI, 2000)

Combining heuristics for default logic reasoning systems. - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (ICTAI, 2000)

Genetic Algorithms for Extension Search in Default Logic - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (CoRR, 2000)

Description of GADEL - Igor Stéphan; Frédéric Saubion; Pascal Nicolas (CoRR, 2000)

Genes and Ants for Default Logic. - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (Answer Set Programming, 2001)

New Generation Systems for Non-monotonic Reasoning. - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (LPNMR, 2001)

Heuristics for a Default Logic Reasoning System. - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (Int. J. Artif. Intell. Tools, 2001)

Answer Set Programming by Ant Colony Optimization. - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (JELIA, 2002)

Optimisation par colonies de fourmis pour la programmation logique étendue. - Pascal Nicolas; Frédéric Saubion; Igor Stéphan (JFPLC, 2002)

A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars. - Frédéric Saubion; Igor Stéphan (Discret. Math. Theor. Comput. Sci., 2002)

Programmation par ensembles-réponses possibilistes. - Pascal Nicolas; Laurent Garcia; Igor Stéphan (JFPLC, 2004)

A possibilistic approach to restore consistency in answer set programming. - Pascal Nicolas; Laurent Garcia; Igor Stéphan (NMR, 2004)

A Possibilistic Inconsistency Handling in Answer Set Programming. - Pascal Nicolas; Laurent Garcia; Igor Stéphan (ECSQARU, 2005)

Possibilistic Stable Models. - Pascal Nicolas; Laurent Garcia; Igor Stéphan (IJCAI, 2005)

Boolean Propagation Based on Literals for Quantified Boolean Formulae. - Igor Stéphan (ECAI, 2006)

Possibilistic uncertainty handling for answer set programming. - Pascal Nicolas; Laurent Garcia; Igor Stéphan; Claire Lefèvre (Ann. Math. Artif. Intell., 2006)

A Unified Framework for Certificate and Compilation for QBF. - Igor Stéphan; Benoit Da Mota (ICLA, 2009)

From (Quantified) Boolean Formulae to Answer Set Programming. - Igor Stéphan; Benoit Da Mota; Pascal Nicolas (J. Log. Comput., 2009)

A new parallel architecture for QBF tools. - Benoit Da Mota; Pascal Nicolas; Igor Stéphan (HPCS, 2010)

Les travaux de Pascal Nicolas. Interrogation, induction et déduction automatiques pour le raisonnement non monotone... et plus encore. - Béatrice Duval; Laurent Garcia; Claire Lefèvre; Igor Stéphan (Rev. d'Intelligence Artif., 2012)

Un panorama sur les procédures de décision séquentielles pour le problème de validité des formules booléennes quantifiées. - Igor Stéphan (Rev. d'Intelligence Artif., 2012)

Compilation for QCSP. - Igor Stéphan (CoRR, 2013)

Functional Semantics for Non-prenex QBF. - Igor Stéphan (ICAART (1), 2014)

The Cut Tool for QCSP. - Vincent Barichard; Igor Stéphan (ICTAI, 2014)

∃-ASP. - Fabien Garreau; Laurent Garcia; Claire Lefèvre; Igor Stéphan (JOWO@IJCAI, 2015)

Justifications and Blocking Sets in a Rule-Based Answer Set Computation. - Christopher Béatrix; Claire Lefèvre; Laurent Garcia; Igor Stéphan (ICLP (Technical Communications), 2016)

Le problème de satisfaction de contraintes quantifiées et les jeux à deux joueurs à horizon fini : le projet QuaCode. - Vincent Barichard; Igor Stéphan (Rev. d'Intelligence Artif., 2017)

ASPeRiX, a first-order forward chaining approach for answer set computing. - Claire Lefèvre; Christopher Béatrix; Igor Stéphan; Laurent Garcia (Theory Pract. Log. Program., 2017)

A New Proof-Theoretical Linear Semantics for CHR. - Igor Stéphan (ICLP (Technical Communications), 2018)

Possibilistic ASP Base Revision by Certain Input. - Laurent Garcia; Claire Lefèvre; Odile Papini; Igor Stéphan; Éric Würbel (IJCAI, 2018)

Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin. - Jean-François Baget; Laurent Garcia; Fabien Garreau; Claire Lefèvre; Swan Rocher; Igor Stéphan (Ann. Math. Artif. Intell., 2018)

Answer Set Programming et interrogation. - Fabien Garreau; Laurent Garcia; Claire Lefèvre; Igor Stéphan (Rev. d'Intelligence Artif., 2018)

Query Answering With Non-Monotonic Rules: A Case Study of Archaeology Qualitative Spatial Reasoning. - Mohamed Ben Ellefi; Pierre Drap; Laurent Garcia; Fabien Garreau; Claire Lefèvre; Odile Papini; Igor Stéphan; Éric Würbel (GCAI, 2019)

Quantified Constraint Handling Rules. - Vincent Barichard; Igor Stéphan (ICLP Technical Communications, 2019)

A Semantic Characterization ASP Base Revision. - Laurent Garcia; Claire Lefèvre; Igor Stéphan; Odile Papini; Éric Würbel (J. Artif. Intell. Res., 2019)

Logic Programming. - Arnaud Lallouet; Yves Moinard; Pascal Nicolas; Igor Stéphan (A Guided Tour of Artificial Intelligence Research (2) (II), 2020)

First-order ASP programs as CHR programs. - Igor Stéphan (SAC, 2021)

Une sémantique opérationnelle pour les QCHR. - Igor Stéphan; Vincent Barichard (JIAF, 2022)

Introducing Constraint Well-Founded Semantics for Constraint Logic Programming Through Rewriting Transformations. - Bryan Garreau; Martín Diguez Lodeiro; Éric Monfroy; Igor Stéphan (ICTAI, 2024)

A Fixpoint Characterisation of Temporal Equilibrium Logic. - Pedro Cabalar; Martín Diéguez; François Laferrière; Torsten Schaub; Igor Stéphan (LPNMR, 2024)

Towards Constraint Temporal Answer Set Programming. - Pedro Cabalar; Martín Diéguez; François Olivier; Torsten Schaub; Igor Stéphan (CoRR, 2025)