Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yves Moinard
2010 – today
- 2010
[c23]Yves Moinard: A Formalism for Causal Explanations with an Answer Set Programming Translation. KSEM 2010: 585-590
[i4]Philippe Besnard, Marie-Odile Cordier, Yves Moinard: Ontology-based inference for causal explanation. CoRR abs/1004.4801 (2010)
[i3]Yves Moinard: A formalism for causal explanations with an Answer Set Programming translation. CoRR abs/1008.3879 (2010)
[i2]
2000 – 2009
- 2008
[j6]Philippe Besnard, Marie-Odile Cordier, Yves Moinard: Ontology-based inference for causal explanation. Integrated Computer-Aided Engineering 15(4): 351-367 (2008)
[c22]Philippe Besnard, Marie-Odile Cordier, Yves Moinard: Deriving explanations from causal information. ECAI 2008: 723-724- 2007
[j5]Yves Moinard: Forgetting Literals with Varying Propositional Symbols. J. Log. Comput. 17(5): 955-982 (2007)
[c21]Philippe Besnard, Marie-Odile Cordier, Yves Moinard: Ontology-Based Inference for Causal Explanation. KSEM 2007: 153-164- 2006
[c20]Philippe Besnard, Marie-Odile Cordier, Yves Moinard: Configurations for Inference Between Causal Statements. KSEM 2006: 292-304- 2005
[c19]Philippe Besnard, Marie-Odile Cordier, Yves Moinard: Configurations for Inference from Causal Statements: Preliminary Report. AI*IA 2005: 282-285- 2004
[c18]- 2002
[j4]Yves Moinard, Raymond Rolland: Characterizations of Preferential Entailments. Logic Journal of the IGPL 10(3): 245-272 (2002)
[c17]Yves Moinard: Linking Makinson and Kraus-Lehmann-Magidor preferential entailments. ECAI 2002: 531-535
[c16]
[i1]Yves Moinard: Linking Makinson and Kraus-Lehmann-Magidor preferential entailments. CoRR cs.AI/0208017 (2002)- 2001
[c15]- 2000
[j3]
[c14]Yves Moinard, Raymond Rolland: Smallest Equivalent Sets for Finite Propositional Formula Circumscription. Computational Logic 2000: 897-911
[c13]
[c12]
1990 – 1999
- 1994
[c11]
[c10]Philippe Besnard, Yves Moinard: Implication Connectives for Logics with Right Weakening. IPMU 1994: 360-369
[c9]
[c8]- 1993
[j2]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
[c7]
[c6]- 1991
[c5]- 1990
[c4]Yves Moinard, Raymond Rolland: Unexpected and Unwanted Results of Circumscription. AIMSA 1990: 61-70
[c3]
1980 – 1989
- 1989
[j1]Philippe Besnard, Yves Moinard, Robert E. Mercer: The Importance of Open and Recursive Circumscription. Artif. Intell. 39(2): 251-262 (1989)- 1988
[c2]
[c1]Yves Moinard: Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes). ICLP/SLP 1988: 1097-1105
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:52 CEST by the dblp team



