2008 |
28 | EE | Philippe Besnard,
Marie-Odile Cordier,
Yves Moinard:
Deriving explanations from causal information.
ECAI 2008: 723-724 |
2007 |
27 | EE | Philippe Besnard,
Marie-Odile Cordier,
Yves Moinard:
Ontology-Based Inference for Causal Explanation.
KSEM 2007: 153-164 |
26 | EE | Yves Moinard:
Forgetting Literals with Varying Propositional Symbols.
J. Log. Comput. 17(5): 955-982 (2007) |
2006 |
25 | EE | Philippe Besnard,
Marie-Odile Cordier,
Yves Moinard:
Configurations for Inference Between Causal Statements.
KSEM 2006: 292-304 |
2005 |
24 | EE | Philippe Besnard,
Marie-Odile Cordier,
Yves Moinard:
Configurations for Inference from Causal Statements: Preliminary Report.
AI*IA 2005: 282-285 |
2004 |
23 | | Yves Moinard:
Plausibility Structures for Default Reasoning.
ECAI 2004: 853-857 |
2002 |
22 | | Yves Moinard:
Linking Makinson and Kraus-Lehmann-Magidor preferential entailments.
ECAI 2002: 531-535 |
21 | | Yves Moinard:
Linking Makinson and Kraus-Lehmann- Magidor preferential entailments.
NMR 2002: 15-24 |
20 | EE | Yves Moinard:
Linking Makinson and Kraus-Lehmann-Magidor preferential entailments
CoRR cs.AI/0208017: (2002) |
19 | EE | Yves Moinard,
Raymond Rolland:
Characterizations of Preferential Entailments.
Logic Journal of the IGPL 10(3): 245-272 (2002) |
2001 |
18 | EE | Yves Moinard:
General Preferential Entailments as Circumscriptions.
ECSQARU 2001: 532-543 |
2000 |
17 | EE | Yves Moinard,
Raymond Rolland:
Smallest Equivalent Sets for Finite Propositional Formula Circumscription.
Computational Logic 2000: 897-911 |
16 | | Yves Moinard:
Characterizing General Preferential Entailments.
ECAI 2000: 474-478 |
15 | | Yves Moinard,
Raymond Rolland:
Equivalent Sets of Formulas for Circumscriptions.
ECAI 2000: 479-483 |
14 | EE | Yves Moinard:
Note about cardinality-based circumscription.
Artif. Intell. 119(1-2): 259-273 (2000) |
1994 |
13 | | Yves Moinard:
Reasoning by Cases without Contraposition in Default Logic.
ECAI 1994: 381-385 |
12 | | Philippe Besnard,
Yves Moinard:
Implication Connectives for Logics with Right Weakening.
IPMU 1994: 360-369 |
11 | | Yves Moinard,
Raymond Rolland:
Around a Powerful Property of Circumscriptions.
JELIA 1994: 34-49 |
10 | | Yves Moinard,
Raymond Rolland:
Preferential Entailments for Circumscriptions.
KR 1994: 461-472 |
1993 |
9 | | Philippe Besnard,
Yves Moinard,
Wilmer Pereira,
Michael Clarke,
Nic Wilson,
Miguel Delgado,
Serafín Moral,
Juan Cano,
Didier Dubois,
Henri Prade,
Luis Fariñas del Cerro,
Jérôme Lang,
Stéphane Amarger,
John Fox,
Paul Krause,
Michael Dohnal,
Christine Froidevaux,
Jérôme Mengin,
Ramon López de Mántaras,
Lluis Godo,
E. H. Mamdani,
John Bigham,
Simon Parsons,
Rudolf Kruse,
Olivier Paillet,
Pierre Siegel,
Philippe Smets,
Yen-Teh Hsia,
Alessandro Saffiotti,
Robert Kennes,
Hong Xu,
Elizabeth Umkehrer,
Kurt Sundermeyer,
Chris Whitney:
DRUMS: Defeasible Reasoning and Uncertainty Management Systems.
AI Commun. 6(1): 27-46 (1993) |
1992 |
8 | | Yves Moinard:
Circumscriptions as Preferential Entailment.
ECAI 1992: 329-333 |
7 | | Yves Moinard:
Unifying Various Approaches to Default Logic.
IPMU 1992: 33-42 |
1991 |
6 | | Yves Moinard,
Raymond Rolland:
Circumscription and Definability.
IJCAI 1991: 432-437 |
1990 |
5 | | Yves Moinard,
Raymond Rolland:
Unexpected and Unwanted Results of Circumscription.
AIMSA 1990: 61-70 |
4 | | Yves Moinard:
Circumscription and Horn Theories.
ECAI 1990: 449-454 |
1989 |
3 | | Philippe Besnard,
Yves Moinard,
Robert E. Mercer:
The Importance of Open and Recursive Circumscription.
Artif. Intell. 39(2): 251-262 (1989) |
1988 |
2 | | Yves Moinard:
Computing Circumscription of Horn Theories.
ECAI 1988: 513-515 |
1 | | Yves Moinard:
Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes).
ICLP/SLP 1988: 1097-1105 |