Possibilistic uncertainty handling for answer set programming P Nicolas, L Garcia, I Stéphan, C Lefèvre Annals of Mathematics and Artificial Intelligence 47, 139-181, 2006 | 104 | 2006 |
Asperix, a first-order forward chaining approach for answer set computing C Lefèvre, C Béatrix, I Stéphan, L Garcia Theory and Practice of Logic Programming 17 (3), 266-310, 2017 | 66 | 2017 |
Possibilistic stable models P Nicolas, L Garcia, I Stéphan Dagstuhl Seminar Proceedings, 2005 | 41 | 2005 |
Using logic programming languages for optical music recognition B Coüasnon, P Brisset, I Stéphan International Conference on the Practical Application of Prolog, 115-134, 1995 | 37 | 1995 |
Gadel: a genetic algorithm to compute default logic extensions P Nicolas, F Saubion, I Stéphan ECAI, 484-490, 2000 | 26 | 2000 |
Boolean propagation based on literals for quantified boolean formulae I Stéphan FRONTIERS IN ARTIFICIAL INTELLIGENCE AND APPLICATIONS 141, 452, 2006 | 14 | 2006 |
A possibilistic inconsistency handling in answer set programming P Nicolas, L Garcia, I Stéphan Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 8th …, 2005 | 14 | 2005 |
Justifications and blocking sets in a rule-based answer set computation C Béatrix, C Lefèvre, L Garcia, I Stéphan Technical Communications of the 32nd International Conference on Logic …, 2016 | 10 | 2016 |
Quantified constraint handling rules V Barichard, I Stéphan arXiv preprint arXiv:1909.08243, 2019 | 9 | 2019 |
Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin JF Baget, L Garcia, F Garreau, C Lefèvre, S Rocher, I Stéphan Annals of mathematics and artificial intelligence 82, 3-41, 2018 | 9 | 2018 |
Heuristics for a default logic reasoning system P Nicolas, F Saubion, I Stéphan International Journal on Artificial Intelligence Tools 10 (04), 503-523, 2001 | 9 | 2001 |
A new parallel architecture for QBF tools B Da Mota, P Nicolas, I Stéphan 2010 International Conference on High Performance Computing & Simulation …, 2010 | 8 | 2010 |
From (quantified) boolean formulae to answer set programming I Stéphan, B Da Mota, P Nicolas Journal of logic and computation 19 (4), 565-590, 2009 | 8 | 2009 |
Answer set programming by ant colony optimization P Nicolas, F Saubion, I Stéphan Logics in Artificial Intelligence: 8th European Conference, JELIA 2002 …, 2002 | 8 | 2002 |
New generation systems for non-monotonic reasoning P Nicolas, F Saubion, I Stephan International Conference on Logic Programming and NonMonotonic Reasoning …, 2001 | 8 | 2001 |
Genetic Algorithms for Extension Search in Default Logic P Nicolas, F Saubion, I Stéphan arXiv preprint cs/0002015, 2000 | 7 | 2000 |
The cut tool for QCSP V Barichard, I Stéphan 26th IEEE International Conference on Tools with Artificial Intelligence …, 2014 | 6 | 2014 |
A unified framework to compute over tree synchronized grammars and primal grammars F Saubion, I Stéphan Discrete Mathematics & Theoretical Computer Science 5, 2002 | 6 | 2002 |
Combining heuristics for default logic reasoning systems P Nicolas, F Saubion, I Stéphan Proceedings 12th IEEE Internationals Conference on Tools with Artificial …, 2000 | 6 | 2000 |
Nouvelles fondations pour la programmation en logique disjonctive I Stephan PhD thesis, These de doctorat de l’université de Rennes, 1995 | 6 | 1995 |