Yves Moinard - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2020

Logic ProgrammingArnaud Lallouet, Yves Moinard, Pascal Nicolas, Igor Stéphan. In Pierre Marquis, Odile Papini, Henri Prade, editors, A Guided Tour of Artificial Intelligence Research: Volume II: AI Algorithms. pages 83-113, Springer, 2020. [doi]

2016

2015

Programmation par ensembles réponses pour simuler l'assolement d'un paysageThomas Guyet, Yves Moinard, René Quiniou. ria, 29(3-4):293-320, 2015. [doi]

2014

Arguments Using Ontological and Causal KnowledgePhilippe Besnard, Marie-Odile Cordier, Yves Moinard. foiks 2014: 79-96 [doi]

2010

A Formalism for Causal Explanations with an Answer Set Programming TranslationYves Moinard. ksem 2010: 585-590 [doi]

2008

Deriving explanations from causal informationPhilippe Besnard, Marie-Odile Cordier, Yves Moinard. ecai 2008: 723-724 [doi]

Ontology-based inference for causal explanationPhilippe Besnard, Marie-Odile Cordier, Yves Moinard. icae, 15(4):351-367, 2008. [doi]

2007

Ontology-Based Inference for Causal ExplanationPhilippe Besnard, Marie-Odile Cordier, Yves Moinard. ksem 2007: 153-164 [doi]

Forgetting Literals with Varying Propositional SymbolsYves Moinard. logcom, 17(5):955-982, 2007. [doi]

2006

Configurations for Inference Between Causal StatementsPhilippe Besnard, Marie-Odile Cordier, Yves Moinard. ksem 2006: 292-304 [doi]

2005

Configurations for Inference from Causal Statements: Preliminary ReportPhilippe Besnard, Marie-Odile Cordier, Yves Moinard. aiia 2005: 282-285 [doi]

2004

Plausibility Structures for Default ReasoningYves Moinard. ecai 2004: 853-857

2002

Linking Makinson and Kraus-Lehmann-Magidor preferential entailmentsYves Moinard. ecai 2002: 531-535

Linking Makinson and Kraus-Lehmann- Magidor preferential entailmentsYves Moinard. lpnmr 2002: 15-24

Characterizations of Preferential EntailmentsYves Moinard, Raymond Rolland. igpl, 10(3):245-272, 2002. [doi]

2001

General Preferential Entailments as CircumscriptionsYves Moinard. ecsqaru 2001: 532-543 [doi]

2000

Smallest Equivalent Sets for Finite Propositional Formula CircumscriptionYves Moinard, Raymond Rolland. cl 2000: 897-911 [doi]

Equivalent Sets of Formulas for CircumscriptionsYves Moinard, Raymond Rolland. ecai 2000: 479-483

Characterizing General Preferential EntailmentsYves Moinard. ecai 2000: 474-478

Note about cardinality-based circumscriptionYves Moinard. ai, 119(1-2):259-273, 2000. [doi]

1994

Implication Connectives for Logics with Right WeakeningPhilippe Besnard, Yves Moinard. ipmu 1995: 360-369

Preferential Entailments for CircumscriptionsYves Moinard, Raymond Rolland. kr 1994: 461-472

Around a Powerful Property of CircumscriptionsYves Moinard, Raymond Rolland. jelia 1994: 34-49

Reasoning by Cases without Contraposition in Default LogicYves Moinard. ecai 1994: 381-385

Notes on change and nonmonotonyYves Moinard. ijis, 9(1):101-118, 1994. [doi]

1993

1992

Circumscriptions as Preferential EntailmentYves Moinard. ecai 1992: 329-333

Unifying Various Approaches to Default LogicYves Moinard. ipmu 1993: 33-42

1991

Circumscription and DefinabilityYves Moinard, Raymond Rolland. IJCAI 1991: 432-437

1990

Circumscription and Horn TheoriesYves Moinard. ecai 1990: 449-454

Unexpected and Unwanted Results of CircumscriptionYves Moinard, Raymond Rolland. aimsa 1990: 61-70

1989

The Importance of Open and Recursive CircumscriptionPhilippe Besnard, Yves Moinard, Robert E. Mercer. ai, 39(2):251-262, 1989.

1988

Computing Circumscription of Horn TheoriesYves Moinard. ecai 1988: 513-515

Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes)Yves Moinard. ICLP 1988: 1097-1105

Sign in or sign up to see more results.

runs on WebDSL