|
|
|
|
Abstraction-based Satisability Solving of Presburger Arithmeti c? Daniel Kroenin g 1, Joel Ouaknine 1, Sanjit A. Seshia 1, and Ofer Strichman 2 1 Computer Science Department ... http://www.cs.cmu.edu/~modelcheck/onr/pubs/presburger04.pdfAbstraction-based Satisability Solving of Presburger Arithmetic Daniel Kroening, Joel Ouaknine Sanjit Seshia, Ofer Strichman January 2004 CMU-CS-04-100 School of Computer Science ... http://reports-archive.adm.cs.cmu.edu/anon/2004/CMU-CS-04-100.pdfDocument details from CiteSeerX (Isaac Councill, Lee Giles): This paper is the system description of the conformant planner C-plan, a SAT-based system for planning in domains whose ... http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.4102 ... Massimo Idini Marco Maratea MRG-DIST University of Genova Genova, Italy Abstract This paper describes TSAT++, an open platform which realizes the lazy SAT-based approach to Satisability ... http://www.loria.fr/~ranise/pdpar04/papers/paper3.pdf ... of propositions that we need to satisfy. 3.0.2 TheGeneralksat Schema. In Table1, we present the general algorithm schemaksat, on which KSAT[6] is based, for deciding the satisability ... http://www.science.uva.nl/~mdr/Publications/Files/m4m-2003-csp.pdf |
|
|