Igor Stéphan

According to our database, Igor Stéphan authored at least 42 papers between 1992 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2022

Une sémantique opérationnelle pour les QCHR.

Igor Stéphan, Vincent Barichard

Proceedings of the 16èmes Journées d'Intelligence Artificielle Fondamentale, 2022

2021

First-order ASP programs as CHR programs.

Igor Stéphan

Proceedings of the SAC '21: The 36th ACM/SIGAPP Symposium on Applied Computing, 2021

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

Quantified Constraint Handling Rules.

Vincent Barichard, Igor Stéphan

Proceedings of the Proceedings 35th International Conference on Logic Programming (Technical Communications), 2019

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

Proceedings of the GCAI 2019. Proceedings of the 5th Global Conference on Artificial Intelligence, 2019

2018

Answer Set Programming et interrogation.

Fabien Garreau, Laurent Garcia, Claire Lefèvre, Igor Stéphan

Rev. d'Intelligence Artif., 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

Possibilistic ASP Base Revision by Certain Input.

Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stéphan, Éric Würbel

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A New Proof-Theoretical Linear Semantics for CHR.

Igor Stéphan

Proceedings of the Technical Communications of the 34th International Conference on Logic Programming, 2018

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

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

2016

Justifications and Blocking Sets in a Rule-Based Answer Set Computation.

Christopher Béatrix, Claire Lefèvre, Laurent Garcia, Igor Stéphan

Proceedings of the Technical Communications of the 32nd International Conference on Logic Programming, 2016

2015

∃-ASP.

Fabien Garreau, Laurent Garcia, Claire Lefèvre, Igor Stéphan

Proceedings of the Joint Ontology Workshops 2015 Episode 1: The Argentine Winter of Ontology co-located with the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), 2015

2014

The Cut Tool for QCSP.

Vincent Barichard, Igor Stéphan

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Functional Semantics for Non-prenex QBF.

Igor Stéphan

Proceedings of the ICAART 2014, 2014

2013

Compilation for QCSP.

Igor Stéphan

CoRR, 2013

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

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

2010

A new parallel architecture for QBF tools.

Benoit Da Mota, Pascal Nicolas, Igor Stéphan

Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

2009

From (Quantified) Boolean Formulae to Answer Set Programming.

Igor Stéphan, Benoit Da Mota, Pascal Nicolas

J. Log. Comput., 2009

A Unified Framework for Certificate and Compilation for QBF.

Igor Stéphan, Benoit Da Mota

Proceedings of the Logic and Its Applications, Third Indian Conference, 2009

2006

Possibilistic uncertainty handling for answer set programming.

Pascal Nicolas, Laurent Garcia, Igor Stéphan, Claire Lefèvre

Ann. Math. Artif. Intell., 2006

Boolean Propagation Based on Literals for Quantified Boolean Formulae.

Igor Stéphan

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005

A Possibilistic Inconsistency Handling in Answer Set Programming.

Pascal Nicolas, Laurent Garcia, Igor Stéphan

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2005

Possibilistic Stable Models.

Pascal Nicolas, Laurent Garcia, Igor Stéphan

Proceedings of the Nonmonotonic Reasoning, 2005

2004

A possibilistic approach to restore consistency in answer set programming.

Pascal Nicolas, Laurent Garcia, Igor Stéphan

Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Programmation par ensembles-réponses possibilistes.

Pascal Nicolas, Laurent Garcia, Igor Stéphan

Proceedings of the Programmation en logique avec contraintes, 2004

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

Optimisation par colonies de fourmis pour la programmation logique étendue.

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Proceedings of the Programmation en logique avec contraintes, 2002

Answer Set Programming by Ant Colony Optimization.

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

2001

Heuristics for a Default Logic Reasoning System.

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Int. J. Artif. Intell. Tools, 2001

New Generation Systems for Non-monotonic Reasoning.

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

Genes and Ants for Default Logic.

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Proceedings of the Answer Set Programming, 2001

2000

Description of GADEL

Igor Stéphan, Frédéric Saubion, Pascal Nicolas

CoRR, 2000

Genetic Algorithms for Extension Search in Default Logic

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

CoRR, 2000

Combining heuristics for default logic reasoning systems.

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 2000

GADEL: a Genetic Algorithm to Compute Default Logic Extensions.

Pascal Nicolas, Frédéric Saubion, Igor Stéphan

Proceedings of the ECAI 2000, 2000

1999

On Implementation of Tree Synchronized Languages.

Frédéric Saubion, Igor Stéphan

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Implanter des langages d'arbres en Prolog.

Frédéric Saubion, Igor Stéphan

Proceedings of the JFPLC'99, 1999

1998

A New Abstract Logic Programming Language and Its Quantifier Elimination Method for Disjunctive Logic Programming.

Igor Stéphan

Proceedings of the Artificial Intelligence: Methodology, 1998

1994

Du ou dans les arbres.

Igor Stéphan

Proceedings of the JFPLC'94, 1994

1992

L'inheritance near-Horn Prolog en Prolog.

Igor Stéphan

Proceedings of the JFPL'92, 1992