Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yves Moinard

dblp:m/YvesMoinard · DBLP profile ↗
← Back
22ranked-venue papers
16as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 21 · 15 first-authorGraphics, computer vision, multimedia, augmented reality and games · 11 · 9 first-authorDatabases, data management, data science and information retrieval · 6 · 3 first-authorTheory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Knowledge representation and reasoning · 100%
Theoretical computer science
5 papers
Graph algorithms and graph theory · 82% Logic in computer science · 18%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic programming
answer set programming
0.212016
Packing Graphs with ASP for Landscape Simulation · IJCAI 2016
Graph algorithms and graph theory › graph theory
graph packing
0.212016
Packing Graphs with ASP for Landscape Simulation · IJCAI 2016
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning
circumscription
0.022000
Note about cardinality-based circumscription · Artif. Intell. 2000
The Importance of Open and Recursive Circumscription · Artif. Intell. 1989
Knowledge, reasoning and agents › Knowledge representation and reasoning
nonmonotonic reasoning
0.022000
Note about cardinality-based circumscription · Artif. Intell. 2000
The Importance of Open and Recursive Circumscription · Artif. Intell. 1989
Logic in computer science › nonmonotonic reasoning
circumscription
0.021994
Preferential Entailments for Circumscriptions · KR 1994
Circumscription and Definability · IJCAI 1991
Logic in computer science
nonmonotonic reasoning
0.011994
Preferential Entailments for Circumscriptions · KR 1994
Logic in computer science › nonmonotonic reasoning
preferential entailment
0.011994
Preferential Entailments for Circumscriptions · KR 1994
Logic in computer science
semantics
0.012000
Note about cardinality-based circumscription · Artif. Intell. 2000
Logic in computer science › model theory
definability
0.011991
Circumscription and Definability · IJCAI 1991
Logic in computer science › logic programming
logic programming semantics
0.011989
The Importance of Open and Recursive Circumscription · Artif. Intell. 1989

Methods — techniques the papers use, named apart from their topics

answer set programming · 0.5fixpoint semantics · 0.0circumscription · 0.0
YearPublicationVenuePosition
2016 Packing Graphs with ASP for Landscape Simulation
Thomas Guyet, Yves Moinard, Jacques Nicolas, Rene Quiniou
IJCAI2
2010 A Formalism for Causal Explanations with an Answer Set Programming Translation
Yves Moinard
KSEM1
2008 Deriving explanations from causal information
abstract
We define an inference system to capture explanations based on causal statements, using an ontology in the form of an IS-A hierarchy. We introduce a simple logical language which makes it possible to express that a fact causes another fact and that a fact explains another fact. We present a set of formal inference patterns from causal statements to explanation statements. We introduce an elementary ontology which gives greater expressiveness to the system while staying close to propositional reasoning. We provide an inference system that captures the patterns discussed, in a datalog (limited predicate) framework.
Philippe Besnard, Marie-Odile Cordier, Yves Moinard
ECAI3
2007 Ontology-Based Inference for Causal Explanation
Philippe Besnard, Marie-Odile Cordier, Yves Moinard
KSEM3
2007 Forgetting Literals with Varying Propositional Symbols
abstract
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to help the automatic computation of various formalisms which are currently used in knowledge representation. We extend here this notion, by allowing propositional symbols to vary while forgetting literals. We describe the new notion, on the syntactical and the semantical side. We provide various different syntactical characterizations, in order to provide various methods for computing the notion introduced here. This confirms that one of the main interests of the notion of ‘forgetting literals’ (original, and new version) is that it provides new kinds of methods of computation. Then, we show how to apply it to the computation of circumscription. This computation has been done before with standard literal forgetting, but here we show how introducing varying propositional symbols simplifies significantly the computation. We revisit a fifteen years old result about computing circumscription, showing that it can be improved in the same way. We provide hints in order to apply this forgetting method also to other logical formalisms.
Yves Moinard
J. Log. Comput.1
2006 Configurations for Inference Between Causal Statements
Philippe Besnard, Marie-Odile Cordier, Yves Moinard
KSEM3
2004 Plausibility Structures for Default Reasoning
Yves Moinard
ECAI1
2002 Linking Makinson and Kraus-Lehmann-Magidor preferential entailments
Yves Moinard
ECAI1
2001 General Preferential Entailments as Circumscriptions
Yves Moinard
ECSQARU1
2000 Characterizing General Preferential Entailments
Yves Moinard
ECAI1
2000 Equivalent Sets of Formulas for Circumscriptions
Yves Moinard, Raymond Rolland
ECAI1
2000 Note about cardinality-based circumscription
Yves Moinard
Artif. Intell.1
1994 Reasoning by Cases without Contraposition in Default Logic
Yves Moinard
ECAI1
1994 Implication Connectives for Logics with Right Weakening
Philippe Besnard, Yves Moinard
IPMU2
1994 Preferential Entailments for Circumscriptions
Yves Moinard, Raymond Rolland
KR1
1994 Notes on change and nonmonotony
abstract
Theories of change and nonmonotonic formalisms originated from the same knowledge representation problems. the differences in their respective aims and methods are illustrated by a comparison between the possible model approach and preferential entailment. Then, one technical way of using a nonmonotonic formalism in order to achieve cognitive change is shortly described, and the same for the other way around. the more philosophically oriented two way passage by Gärdenfors and Makinson is then examined at length, including the newest versions providing a general translation through epistemic entrenchment. Some kind of “concretization” of these theoretical considerations are then described. Finally, thanks to Gärdenfors and Makinson's passage, we translate some important criteria for belief revision into nonmonotony. This general comparison provides as many insights on the nonmonotonic side as on the cognitive change side. © 1994 John Wiley & Sons, Inc.
Yves Moinard
Int. J. Intell. Syst.1
1992 Circumscriptions as Preferential Entailment
Yves Moinard
ECAI1
1992 Unifying Various Approaches to Default Logic
Yves Moinard
IPMU1
1991 Circumscription and Definability
Yves Moinard, Raymond Rolland
IJCAI1
1990 Circumscription and Horn Theories
Yves Moinard
ECAI1
1989 The Importance of Open and Recursive Circumscription
Philippe Besnard, Yves Moinard, Robert E. Mercer
Artif. Intell.2
1988 Computing Circumscription of Horn Theories
Yves Moinard
ECAI1