Yves Moinard

René Quiniou

Rev. d'Intelligence Artif., 2015

2014

Using Answer Set Programming for pattern mining.

[BibT_eX]

[DOI]

Thomas Guyet

René Quiniou

CoRR, 2014

Arguments Using Ontological and Causal Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2014

2010

Using ASP with recent extensions for causal explanations

[BibT_eX]

[DOI]

CoRR, 2010

A Formalism for Causal Explanations with an Answer Set Programming Translation.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, 2010

2008

Ontology-based inference for causal explanation.

[BibT_eX]

[DOI]

Integr. Comput. Aided Eng., 2008

Deriving explanations from causal information.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2008, 2008

2007

Forgetting Literals with Varying Propositional Symbols.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

2006

Configurations for Inference Between Causal Statements.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, 2006

2005

Configurations for Inference from Causal Statements: Preliminary Report.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2004

Plausibility Structures for Default Reasoning.

[BibT_eX]

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2002

Characterizations of Preferential Entailments.

[BibT_eX]

[DOI]

Log. J. IGPL, 2002

Linking Makinson and Kraus-Lehmann-Magidor preferential entailments.

[BibT_eX]

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

2001

General Preferential Entailments as Circumscriptions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2001

2000

Note about cardinality-based circumscription.

[BibT_eX]

[DOI]

Artif. Intell., 2000

Equivalent Sets of Formulas for Circumscriptions.

[BibT_eX]

Proceedings of the ECAI 2000, 2000

Characterizing General Preferential Entailments.

[BibT_eX]

Proceedings of the ECAI 2000, 2000

Smallest Equivalent Sets for Finite Propositional Formula Circumscription.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic, 2000

1994

Notes on change and nonmonotony.

[BibT_eX]

[DOI]

Int. J. Intell. Syst., 1994

Preferential Entailments for Circumscriptions.

[BibT_eX]

Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Around a Powerful Property of Circumscriptions.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

Implication Connectives for Logics with Right Weakening.

[BibT_eX]

[DOI]

Proceedings of the Advances in Intelligent Computing, 1994

Reasoning by Cases without Contraposition in Default Logic.

[BibT_eX]

Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

1993

DRUMS: Defeasible Reasoning and Uncertainty Management Systems.

[BibT_eX]

[DOI]

AI Commun., 1993

1992

Unifying Various Approaches to Default Logic.

[BibT_eX]

[DOI]

Proceedings of the IPMU '92, 1992

Circumscriptions as Preferential Entailment.

[BibT_eX]

Proceedings of the 10th European Conference on Artificial Intelligence, 1992

1991

Circumscription and Definability.

[BibT_eX]

[DOI]

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1990

Circumscription and Horn Theories.

[BibT_eX]

Proceedings of the 9th European Conference on Artificial Intelligence, 1990

Unexpected and Unwanted Results of Circumscription.

[BibT_eX]

Proceedings of the Artificial Intelligence IV: Methodology, Systems, Applications, 1990

1989

The Importance of Open and Recursive Circumscription.

[BibT_eX]

[DOI]

Robert E. Mercer

Artif. Intell., 1989

1988

Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes).

[BibT_eX]

Proceedings of the Logic Programming, 1988

Computing Circumscription of Horn Theories.

[BibT_eX]