Searching for authors named "Thierry Castell" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Hidden Gold in Random Generation of SAT Satisfiable Instances
by Thierry Castell, Michel Cayrol, Irit Universite, Irit Universite, Paul Sabatier, Paul Sabatier — 1997 — In Proceedings. of AAAI-97
…Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other generators of satisfiable instances generate instances that are not intrinsically hard, or exhaustive tests have not been …
Cited by 1 (0 self) – Add To MetaCart

Using the Davis and Putnam procedure for an efficient computation of preferred models
by Thierry Castell, Claudette Cayrol, Michel Cayrol, Daniel Le Berre — 1996 — In ECAI'96, 350--354
…Some famous problems (ATMS inference, Closed World Reasoning (CWR) for instance) can be replaced by a problem of preferred model computation. We thus propose a preference relation between models based on a preference relation between literals and an "efficient" algorithm to compute the associated pr…
Cited by 3 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB