Pierre Marquis

Pierre Marquis

Auto-generated profile, based on publicly available information

Pierre Marquis

Univ. Artois, CNRS, CRIL, Lens, France

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2010 in Artificial Intelligence
Verified
Journal Article
Closed access
JLJérôme Lang
Jérôme Lang
PMPierre Marquis
Pierre Marquis

1 January 2000
Verified
Book Chapter
Closed access
PDF file
PMPierre Marquis
Pierre Marquis

25 April 2009 in Synthese
Verified
Journal Article
Open access
PDF file
HDHans van Ditmarsch
Hans van Ditmarsch
AHAndreas Herzig
Andreas Herzig
JLJérôme Lang
Jérôme Lang
PMPierre Marquis
Pierre Marquis
We model the forgetting of propositional variables in a modal logical context where agents become ignorant and are aware of each others’ or their own resulting ignorance. The resulting logic is sound and complete. It can be compared to variable-forgetting as abstraction from information, wherein agents become unaware of certain variables: by employing elementary results for bisimulation, it follows that beliefs not involving the forgotten atom(s) remain true.

5 June 2004 in Artificial Intelligence
Verified
Journal Article
Closed access
ADAdnan Darwiche
Adnan Darwiche
PMPierre Marquis
Pierre Marquis

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
JLJean-Marie Lagniez
Jean-Marie Lagniez
PMPierre Marquis
Pierre Marquis
We present a recursive algorithm for projected model counting, i.e., the problem consisting in determining the number of models k∃X.Σk of a propositional formula Σ after eliminating from it a given set X of variables. Based on a ”standard” model counter, our algorithm projMC takes advantage of a disjunctive decomposition scheme of ∃X.Σ for computing k∃X.Σk. It also looks for disjoint components in its input for improving the computation. Our experiments show that in many cases projMC is significantly more efficient than the previous algorithms for projected model counting from the literature.

1 August 2023
Verified
Conference Paper
Open access
PDF file
GAGilles Audemard
Gilles Audemard
SBSteve Bellart
Steve Bellart
JLJean-Marie Lagniez
Jean-Marie Lagniez
PMPierre Marquis
Pierre Marquis
We present two algorithms for generating (resp. evaluating) abductive explanations for boosted regression trees. Given an instance x and an interval I containing its value F (x) for the boosted regression tree F at hand, the generation algorithm returns a (most general) term t over the Boolean conditions in F such that every instance x′ satisfying t is such that F (x′ ) ∈ I. The evaluation algorithm tackles the corresponding inverse problem: given F , x and a term t over the Boolean conditions in F such that t covers x, find the least interval I_t such that for every instance x′ covered by t we have F (x′ ) ∈ I_t . Experiments on various datasets show that the two algorithms are practical enough to be used for generating (resp. evaluating) abductive explanations for boosted regression trees based on a large number of Boolean conditions.