MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Philippe Chatalic" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 4 documents found, showing 1 through 4.
ATOM RSS
  • Davis and Putnam 40 years later: a first experimentation.  
  • by Philippe Chatalic, Laurent Simon — 2000
  • …This paper presents an experimental study of the very popular Davis and Putnam procedure, as stated in its original version of 1960. Though widely acknowledged in the literature as inecient, it seems that no real experimental study has been conducted to test this procedure in a practical way and to …
  • Add To MetaCart
  • SatEx: A Web-based Framework for SAT Experimentation  
  • by Laurent Simon, Philippe Chatalic — 2001 — Electronic Notes in Discrete Mathematics
  • …SatEx is a web site devoted to SAT experimentation. It is not only a front end to a database gathering an exhaustive number of executions, but it also allows dynamic results synthesis as well as detailed explorations of experimentation results. Being dynamically generated and constantly updated…
  • Cited by 12 (3 self)Add To MetaCart
  • ZRes: The old Davis-Putnam procedure meets ZBDD  
  • by Philippe Chatalic, Laurent Simon — 2000 — In 17th Intl. Conf. on Automated Deduction (CADE’17), volume 1831 of LNAI
  • …. ZRes is a propositional prover based on the original procedure of Davis and Putnam, as opposed to its modied version of Davis, Logeman and Loveland, on which most of the current ecient SAT provers are based. On some highly structured SAT instances, such as the well known Pigeon Hole and Urquha…
  • Cited by 12 (1 self)Add To MetaCart
  • Multi-Resolution on Compressed Sets of Clauses  
  • by Philippe Chatalic, Laurent Simon — 2000 — Proc. of 12th International Conference on Tools with Artificial Intelligence (ICTAI-2000
  • …This paper presents a system based on new operators for handling sets of propositional clauses represented by means of ZBDDs. The high compression power of such data structures allows efficient encodings of structured instances. A specialized operator for the distribution of sets of clauses is intro…
  • Cited by 26 (4 self)Add To MetaCart
Help! Showing 1 through 4.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB