Computing Circumscription of Horn Theories. - Yves Moinard (ECAI, 1988)

Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes). - Yves Moinard (ICLP/SLP, 1988)

The Importance of Open and Recursive Circumscription. - Philippe Besnard; Yves Moinard; Robert E. Mercer (Artif. Intell., 1989)

Unexpected and Unwanted Results of Circumscription. - Yves Moinard; Raymond Rolland (AIMSA, 1990)

Circumscription and Horn Theories. - Yves Moinard (ECAI, 1990)

Circumscription and Definability. - Yves Moinard; Raymond Rolland (IJCAI, 1991)

Circumscriptions as Preferential Entailment. - Yves Moinard (ECAI, 1992)

Unifying Various Approaches to Default Logic. - Yves Moinard (IPMU, 1992)

DRUMS: Defeasible Reasoning and Uncertainty Management Systems. - Philippe Besnard; Yves Moinard; Wilmer Pereira; Michael Clarke; Nic Wilson; Miguel Delgado 001; Serafín Moral; Juan Cano; Didier Dubois; Henri Prade; Luis Fariñas del Cerro; Jérôme Lang; et al. (AI Commun., 1993)

Reasoning by Cases without Contraposition in Default Logic. - Yves Moinard (ECAI, 1994)

Implication Connectives for Logics with Right Weakening. - Philippe Besnard; Yves Moinard (IPMU, 1994)

Around a Powerful Property of Circumscriptions. - Yves Moinard; Raymond Rolland (JELIA, 1994)

Preferential Entailments for Circumscriptions. - Yves Moinard; Raymond Rolland (KR, 1994)

Notes on change and nonmonotony. - Yves Moinard (Int. J. Intell. Syst., 1994)

Smallest Equivalent Sets for Finite Propositional Formula Circumscription. - Yves Moinard; Raymond Rolland (Computational Logic, 2000)

Characterizing General Preferential Entailments. - Yves Moinard (ECAI, 2000)

Equivalent Sets of Formulas for Circumscriptions. - Yves Moinard; Raymond Rolland (ECAI, 2000)

Note about cardinality-based circumscription. - Yves Moinard (Artif. Intell., 2000)

General Preferential Entailments as Circumscriptions. - Yves Moinard (ECSQARU, 2001)

Linking Makinson and Kraus-Lehmann-Magidor preferential entailments. - Yves Moinard (ECAI, 2002)

Characterizations of Preferential Entailments. - Yves Moinard; Raymond Rolland (Log. J. IGPL, 2002)

Plausibility Structures for Default Reasoning. - Yves Moinard (ECAI, 2004)

Configurations for Inference from Causal Statements: Preliminary Report. - Philippe Besnard; Marie-Odile Cordier; Yves Moinard (AI*IA, 2005)

Configurations for Inference Between Causal Statements. - Philippe Besnard; Marie-Odile Cordier; Yves Moinard (KSEM, 2006)

Forgetting Literals with Varying Propositional Symbols. - Yves Moinard (J. Log. Comput., 2007)

Deriving explanations from causal information. - Philippe Besnard; Marie-Odile Cordier; Yves Moinard (ECAI, 2008)

Ontology-based inference for causal explanation. - Philippe Besnard; Marie-Odile Cordier; Yves Moinard (Integr. Comput. Aided Eng., 2008)

A Formalism for Causal Explanations with an Answer Set Programming Translation. - Yves Moinard (KSEM, 2010)

Using ASP with recent extensions for causal explanations - Yves Moinard (CoRR, 2010)

Arguments Using Ontological and Causal Knowledge. - Philippe Besnard; Marie-Odile Cordier; Yves Moinard (FoIKS, 2014)

Using Answer Set Programming for pattern mining. - Thomas Guyet; Yves Moinard; René Quiniou (CoRR, 2014)

Programmation par ensembles réponses pour simuler l'assolement d'un paysage. - Thomas Guyet; Yves Moinard; René Quiniou (Rev. d'Intelligence Artif., 2015)

Fouille de motifs séquentiels avec ASP. - Thomas Guyet; Yves Moinard; Rene Quiniou; Torsten Schaub (EGC, 2016)

Efficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks. - Thomas Guyet; Yves Moinard; René Quiniou; Torsten Schaub (EGC (best of volume), 2016)

Packing Graphs with ASP for Landscape Simulation. - Thomas Guyet; Yves Moinard; Jacques Nicolas; René Quiniou (IJCAI, 2016)

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