Navarro-Pérez, JA;
Voronkov, A;
(2007)
Encodings of problems in effectively propositional logic.
In:
Theory and Applications of Satisfiability Testing – SAT 2007. 10th International Conference, Lisbon, Portugal, May 28-31, 2007. Proceedings.
(3 - 3).
Springer Berlin Heidelberg
![[thumbnail of Navarro_sat07_converted.pdf]](https://discovery-pp.ucl.ac.uk/style/images/fileicons/application_pdf.png) Preview |
PDF
Navarro_sat07_converted.pdf Download (155kB) |
Abstract
Solving various combinatorial problems by their translation to the propositional satisfiability problem has become commonly accepted. By optimising such translations and using efficient SAT solvers one can often solve hard problems in various domains, such as formal verification and planning.
| Type: | Book chapter |
|---|---|
| Title: | Encodings of problems in effectively propositional logic |
| ISBN-13: | 978-3-540-72787-3 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/978-3-540-72788-0_2 |
| Publisher version: | http://dx.doi.org/10.1007/978-3-540-72788-0_2 |
| Language: | English |
| Additional information: | This is the authors' accepted version of this published paper. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-72788-0_2 |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/1360533 |
Archive Staff Only
 |
View Item |
