A Theorem Prover for Lukaszewicz' Open Default Theory. - Pascal Nicolas; Béatrice Duval (ECSQARU, 1995)

Logique des défauts de Lukaszewicz : un démonstrateur basé sur la SLD-résolution pour les théories ouvertes. - Pascal Nicolas; Béatrice Duval (JFPLC, 1995)

Lukaszewicz' Default Logic: A Theorem Prover Based on SLD-Resolution for Open Default Theory. - Pascal Nicolas; Béatrice Duval (WOCFAI, 1995)

XRay: A Prolog Technology Theorem Prover for Default Reasoning: A System Description. - Torsten Schaub; Stefan Brüning; Pascal Nicolas (CADE, 1996)

An Implementation Platform for Query-Answering in Default Logics: Theoretical Underpinnings. - Torsten Schaub; Pascal Nicolas (ISMIS, 1997)

An Implementation Platform for Query-Answering: X-RAY. - Torsten Schaub; Pascal Nicolas (LPNMR, 1997)

Extension Calculus and Query Answering in Prioritized Default Logic. - Farid Benhammadi; Pascal Nicolas; Torsten Schaub (AIMSA, 1998)

The XRay system: An implementation platform for local query-answering in default logics. - Pascal Nicolas; Torsten Schaub (Applications of Uncertainty Formalisms, 1998)

Query-Answering in Prioritized Default Logic. - Farid Benhammadi; Pascal Nicolas; Torsten Schaub (ESCQARU, 1999)

Learning Default Theories. - Béatrice Duval; Pascal Nicolas (ESCQARU, 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)

Representation of Incomplete Knowledge by Induction of Default Theories. - Pascal Nicolas; Béatrice Duval (LPNMR, 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)

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)

Possibilistic Stable Model Computing. - Pascal Nicolas; Claire Lefèvre (Answer Set Programming, 2005)

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)

Dimension reduction methods for the early syncope prediction by artificial neural networks. - Mathieu Feuilloy; Daniel Schang; Pascal Nicolas; Jacques Olivier Fortrat; Jacques Victor (ISSPA, 2005)

Comparison of Feature Selection Methods for Syncope Prediction. - Mathieu Feuilloy; Daniel Schang; Pascal Nicolas (IEEE Congress on Evolutionary Computation, 2006)

A quick low cost method for syncope prediction. - Mathieu Feuilloy; Daniel Schang; Pascal Nicolas (EUSIPCO, 2006)

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

Using Answer Set Programming in an Inference-Based approach to Natural Language Semantics - Farid Nouioua; Pascal Nicolas (CoRR, 2006)

Dealing Automatically with Exceptions by Introducing Specificity in ASP. - Laurent Garcia; Stéphane Ngoma; Pascal Nicolas (ECSQARU, 2009)

A First Order Forward Chaining Approach for Answer Set Computing. - Claire Lefèvre; Pascal Nicolas (LPNMR, 2009)

The First Version of a New ASP Solver : ASPeRiX. - Claire Lefèvre; Pascal Nicolas (LPNMR, 2009)

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

Dialectical Proofs for Constrained Argumentation. - Caroline Devred; Sylvie Doutre; Claire Lefèvre; Pascal Nicolas (COMMA, 2010)

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

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