Contact:
e: csmg(at)swansea.ac.uk
i: curriculum vitae
Address:
Matthew Gwynne
Computer Science
Swansea University
Swansea
SA2 8PP
UK
Computer Science
Swansea University
Swansea
SA2 8PP
UK
Matthew Gwynne, BSc (Swansea), MRes (Swansea)
PhD Student
I am currently a PhD student under the supervision of Oliver Kullmann.
I am currently investigating what it means to be a "good" SAT representation, using notions from satisfiability, constraint programming, propositional proof complexity and knowledge representation. For more information, see the project webpage and the OKlibrary.
More generally, my research interests include: SAT and Constraint Satisfaction; data analysis and representations; the application of SAT to cryptography; Ramsey Theory and other combinatorial problems .
I am currently investigating what it means to be a "good" SAT representation, using notions from satisfiability, constraint programming, propositional proof complexity and knowledge representation. For more information, see the project webpage and the OKlibrary.
More generally, my research interests include: SAT and Constraint Satisfaction; data analysis and representations; the application of SAT to cryptography; Ramsey Theory and other combinatorial problems .
Publications and other materials
- Towards a theory of good SAT representations Technical report - arXiv:1302.4421v1 [cs.AI] [webpage]
- Generalising unit-refutation completeness and SLUR via nested input resolution Journal of Automating Reasoning (to appear)
- Generalising and Unifying SLUR and Unit-refutation Completeness SOFSEM 2013, LNCS 7741, pages 220-232 [webpage]
- Advanced Encryption Standard II benchmarks Proceedings of SAT Challenge 2012 - [PDF] [webpage]
- Towards a better understanding of hardness CP 2011 (Doctoral Program) - Perugia [PDF] [webpage]
- Towards a better understanding of representing problems as SAT problems LCC 2011 - Toronto [PDF] [webpage]
- Propositional Satisiability and Applications in Cryptography and Ramsey Problems MRes Thesis - Swansea [PDF]
Talks
- Unifying hierarchies of fast SAT decision and knowledge compilation SOFSEM 2013 - Czech Republic [PDF]
- Towards a better understanding of SAT-hardness: Constructing soft SAT-representations of boolean functions, with applications to AES+DES CP 2011 (Doctoral Program) - Perugia [PDF]
- On the hardness of (satisfiable) conjunctive normal forms PCV seminar (April 2011) - Swansea [PDF]
- On the hardness of (satisfiable) conjunctive normal forms BCTCS 2011 - Birmingham [PDF]
- Attacking AES via SAT BCTCS 2009 - Warwick [PDF]
Projects:
- Developer for the OKlibrary : an open-source research platform for generalised SAT solving.
- Co-organiser of the PCV Seminar Series (2010 - Present).
- Local organiser for SAT 2009.