Igor Stéphan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

2022

Une sémantique opérationnelle pour les QCHRIgor Stéphan, Vincent Barichard. jiaf 2022: 110-119 [doi]

2021

First-order ASP programs as CHR programsIgor Stéphan. SAC 2021: 881-888 [doi]

2019

Query Answering With Non-Monotonic Rules: A Case Study of Archaeology Qualitative Spatial ReasoningMohamed Ben Ellefi, Pierre Drap, Laurent Garcia, Fabien Garreau, Claire Lefèvre, Odile Papini, Igor Stéphan, Eric Würbel. gcai 2019: 94-107 [doi]

A Semantic Characterization ASP Base RevisionLaurent Garcia, Claire Lefèvre, Igor Stéphan, Odile Papini, Eric Würbel. jair, 66:989-1029, 2019. [doi]

2018

2017

2016

Justifications and Blocking Sets in a Rule-Based Answer Set ComputationChristopher Béatrix, Claire Lefèvre, Laurent Garcia, Igor Stéphan. ICLP 2016: [doi]

2015

∃-ASPFabien Garreau, Laurent Garcia, Claire Lefèvre, Igor Stéphan. IJCAI 2015: [doi]

2014

Functional Semantics for Non-prenex QBFIgor Stéphan. icaart 2014: 358-365 [doi]

The Cut Tool for QCSPBarichard Vincent, Igor Stéphan. ictai 2014: 883-890 [doi]

2012

Les travaux de Pascal Nicolas. Interrogation, induction et déduction automatiques pour le raisonnement non monotone... et plus encoreBéatrice Duval, Laurent Garcia, Claire Lefèvre, Igor Stéphan. ria, 26(1-2):11-38, 2012. [doi]

Un panorama sur les procédures de décision séquentielles pour le problème de validité des formules booléennes quantifiéesIgor Stéphan. ria, 26(1-2):163-196, 2012. [doi]

2010

A new parallel architecture for QBF toolsBenoit Da Mota, Pascal Nicolas, Igor Stéphan. ieeehpcs 2010: 324-330 [doi]

2009

A Unified Framework for Certificate and Compilation for QBFIgor Stéphan, Benoit Da Mota. icla 2009: 210-223 [doi]

From (Quantified) Boolean Formulae to Answer Set ProgrammingIgor Stéphan, Benoit Da Mota, Pascal Nicolas. logcom, 19(4):565-590, 2009. [doi]

2006

Possibilistic uncertainty handling for answer set programmingPascal Nicolas, Laurent Garcia, Igor Stéphan, Claire Lefèvre. AMAI, 47(1-2):139-181, 2006. [doi]

Boolean Propagation Based on Literals for Quantified Boolean FormulaeIgor Stéphan. ecai 2006: 452-456

2005

Possibilistic Stable ModelsPascal Nicolas, Laurent Garcia, Igor Stéphan. IJCAI 2005: 248-253 [doi]

Possibilistic Stable ModelsPascal Nicolas, Laurent Garcia, Igor Stéphan. Dagstuhl 2005: [doi]

A Possibilistic Inconsistency Handling in Answer Set ProgrammingPascal Nicolas, Laurent Garcia, Igor Stéphan. ecsqaru 2005: 402-414 [doi]

2004

A possibilistic approach to restore consistency in answer set programmingPascal Nicolas, Laurent Garcia, Igor Stéphan. lpnmr 2004: 306-312 [doi]

Programmation par ensembles-réponses possibilistesPascal Nicolas, Laurent Garcia, Igor Stéphan. jfplc 2004:

2002

Optimisation par colonies de fourmis pour la programmation logique étenduePascal Nicolas, Frédéric Saubion, Igor Stéphan. jfplc 2002: 57

Answer Set Programming by Ant Colony OptimizationPascal Nicolas, Frédéric Saubion, Igor Stéphan. jelia 2002: 481-492 [doi]

A Unified Framework to Compute over Tree Synchronized Grammars and Primal GrammarsFrédéric Saubion, Igor Stéphan. dmtcs, 5(1):227-262, 2002. [doi]

2001

Heuristics for a Default Logic Reasoning SystemPascal Nicolas, Frédéric Saubion, Igor Stéphan. ijait, 10(4):503-523, 2001.

New Generation Systems for Non-monotonic ReasoningPascal Nicolas, Frédéric Saubion, Igor Stéphan. lpnmr 2001: 309-321 [doi]

Genes and Ants for Default LogicPascal Nicolas, Frédéric Saubion, Igor Stéphan. asp 2001: [doi]

2000

GADEL: a Genetic Algorithm to Compute Default Logic ExtensionsPascal Nicolas, Frédéric Saubion, Igor Stéphan. ecai 2000: 484-490

Combining heuristics for default logic reasoning systemsPascal Nicolas, Frédéric Saubion, Igor Stéphan. ictai 2000: 393-400 [doi]

1999

Implanter des langages d arbres en PrologFrédéric Saubion, Igor Stéphan. jfplc 1999: 89-106

On Implementation of Tree Synchronized LanguagesFrédéric Saubion, Igor Stéphan. RTA 1999: 382-396 [doi]

1998

A New Abstract Logic Programming Language and Its Quantifier Elimination Method for Disjunctive Logic ProgrammingIgor Stéphan. aimsa 1998: 403-416 [doi]

1994

Du ou dans les arbresIgor Stéphan. jfplc 1994: 93-108

1992

L inheritance near-Horn Prolog en PrologIgor Stéphan. jfplc 1992: 403-419

Sign in or sign up to see more results.

runs on WebDSL