=Paper=
{{Paper
|id=Vol-556/paper-3
|storemode=property
|title=Presenting Constraints
|pdfUrl=https://ceur-ws.org/Vol-556/paper02.pdf
|volume=Vol-556
|dblpUrl=https://dblp.org/rec/conf/ftp/Jeavons09
}}
==Presenting Constraints==
<pdf width="1500px">https://ceur-ws.org/Vol-556/paper02.pdf</pdf>
<pre>
                 Presenting Constraints

                                Peter Jeavons
                   Oxford University Computing Laboratory
                   Wolfson Building, Parks Road, Oxford UK



Abstract. We describe the constraint satisfaction problem and show that it uni-
fies a very wide variety of computational problems. We discuss the techniques
that have been used to analyse the complexity of different forms of constraint sat-
isfaction problem, focusing on the algebraic approach, explaining the basic ideas
and highlighting some of the recent results in this area.



The above abstract belongs to a joint invited talk at FTP & Tableaux 2009. The
full version of the paper is included in [1].



References
1. P. Jeavons. Presenting constraints. In M. Giese and A. Waaler, editors, Au-
   tomated Reasoning with Analytic Tableaux and Related Methods, 18th In-
   ternational Conference, TABLEAUX 2009, volume 5607 of Lecture Notes in
   Computer Science, pages 1–15. Springer, 2009.

</pre>