Thierry Castell

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

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:34/802 · DBLP profile ↗

← Back

4ranked-venue papers

4as first author

0since 2021 · last 1998

—ORCID · none

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

Artificial intelligence and machine learning · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 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.

Theoretical computer science

1 paper

Automated reasoning and model checking · 87% Algorithms and data structures · 13%

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

Topic	Papers	Last	Evidence papers
Automated reasoning and model checking › satisfiability › SAT solving SAT instance generation	1	1997	Hidden Gold in Random Generation of SAT Satisfiable Instances · IJCAI (1) 1997
Automated reasoning and model checking satisfiability	1	1997	Hidden Gold in Random Generation of SAT Satisfiable Instances · IJCAI (1) 1997
Algorithms and data structures › randomized algorithms › sampling random generation	1	1997	Hidden Gold in Random Generation of SAT Satisfiable Instances · IJCAI (1) 1997

Year	Publication	Venue	Position
1998	Propositional Satisfaction Problems and Clausal CSPs Thierry Castell, Hélène Fargier	ECAI	1
1997	Hidden Gold in Random Generation of SAT Satisfiable Instances Thierry Castell, Michel Cayrol	IJCAI (1)	1
1996	Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models Thierry Castell, Claudette Cayrol, Michel Cayrol, Daniel Le Berre	ECAI	1
1996	Computation of Prime Implicates and Prime Implicants by a Variant of the Davis and Putnam Procedure abstract The problem is the transformation of a conjunctive normal form (CNF) into a minimized (for the inclusion operator) disjunctive normal form (DNF) and vice versa. This operation is called the unionist product. For a CNF (resp. DNF), one pass of the unionist product provides the prime implicants (resp. implicates); two passes provide the prime implicates (resp. implicants). An algorithm built upon the classical Davis and Putnam procedure is presented for calculating, without the explicit minimization for the inclusion, this unionist product. Thierry Castell	ICTAI	1