( en | de | ru )

 

Disambiguation of "Moinard, Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Smallest Equivalent Sets for Finite Propositional Formula Circumscription.

, and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 897-911. Springer, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthieu Moinard

Yves Robert

Yves Steinmetz

Yves Hoffmann

Yves Burkhardt

 

Other publications of authors with the same name

Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes).. ICLP/SLP, page 1097-1105. MIT Press, (1988)Preferential Entailments for Circumscriptions., and . KR, page 461-472. Morgan Kaufmann, (1994)Equivalent Sets of Formulas for Circumscriptions., and . ECAI, page 479-483. IOS Press, (2000)Unexpected and Unwanted Results of Circumscription., and . AIMSA, page 61-70. North-Holland, (1990)Plausibility Structures for Default Reasoning.. ECAI, page 853-857. IOS Press, (2004)Linking Makinson and Kraus-Lehmann-Magidor preferential entailments.. ECAI, page 531-535. IOS Press, (2002)Configurations for Inference from Causal Statements: Preliminary Report., , and . AI*IA, volume 3673 of Lecture Notes in Computer Science, page 282-285. Springer, (2005)Forgetting Literals with Varying Propositional Symbols.. J. Log. Comput., 17 (5): 955-982 (2007)Configurations for Inference Between Causal Statements., , and . KSEM, volume 4092 of Lecture Notes in Computer Science, page 292-304. Springer, (2006)General Preferential Entailments as Circumscriptions.. ECSQARU, volume 2143 of Lecture Notes in Computer Science, page 532-543. Springer, (2001)