UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Encodings of problems in effectively propositional logic

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 Green open access

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


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
Open access status:An open access version is available from UCL Discovery
Publisher version:http://dx.doi.org/10.1007/978-3-540-72788-0_2
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 > School of BEAMS > Faculty of Engineering Science > Computer Science

View download statistics for this item

Archive Staff Only: edit this record