|
[J6]
|
Florent Madelaine and Barnaby Martin.
The complexity of positive first-order logic without equality.
ACM Transactions on Computational Logic (TOCL) To appear, accepted in
November 2010.
(23 pages) Journal version of the LICS'09 paper.
[ .pdf |
Abstract ]
|
|
[J5]
|
Florent Madelaine.
Universal structures and the logic of forbidden patterns.
Logical Methods In Computer Science, 5(2), 2009.
(23 pages) Journal version of the CSR'06 and CSL'06 papers.
[ .pdf |
Abstract ]
|
|
[J4]
|
Florent Madelaine and Iain A. Stewart.
Improved upper and lower bounds on the feedback vertex numbers of
grids and butterflies.
Discrete mathematics, 308(18):4144-4164, 2008.
[ .pdf |
Abstract ]
|
|
[J3]
|
Florent Madelaine and Iain A. Stewart.
Constraint satisfaction, logic and forbidden patterns.
SIAM Journal of Computing, 37(1):132-163, 2007.
[ .pdf |
Abstract ]
|
|
[J2]
|
Tomás Feder, Florent Madelaine, and Iain A. Stewart.
Dichotomies for classes of homomorphism problems involving unary
functions.
Theoret. Comput. Sci., 314(1-2):1-43, 2004.
[ .ps.gz |
.ps |
Abstract ]
|
|
[J1]
|
Florent R. Madelaine and Iain A. Stewart.
Some problems not definable using structure homomorphisms.
Ars Combin., 67:153-159, 2003.
[ .ps.gz |
.ps |
Abstract ]
|
|
[C10]
|
Florent Madelaine and Barnaby Martin.
A tetrachotomy for positive first-order logic without equality.
In Proceedings of the Twenty-Sixth Annual IEEE Symposium on
Logic in Computer Science. IEEE Computer Society, 2011.
[ .pdf |
Abstract ]
|
|
[C9]
|
Florent Madelaine.
De la complexité des problèmes de contraintes.
In Arnaud Lallouet, editor, Actes des Septièmes Journées
Francophones de Programmation par Contraintes, pages 201-211, 2011.
[ .pdf |
Abstract ]
|
|
[C8]
|
Florent Madelaine.
On the containment of forbidden patterns problems.
In Dave Cohen, editor, Principles and Practice of Constraint
Programming - CP 2010, 16th International Conference, CP 2010, St Andrews,
Scotland, 6-10th September 2010, Proceedings, volume 6308 of Lecture
Notes in Computer Science, pages 345-359. Springer, 2010.
[ .pdf |
Abstract ]
|
|
[C7]
|
Florent Madelaine and Barnaby Martin.
The complexity of positive first-order logic without equality.
In Proceedings of the Twenty-Third Annual IEEE Symposium on
Logic in Computer Science. IEEE Computer Society, 2009.
[ .pdf |
Abstract ]
|
|
[C6]
|
Hubie Chen, Florent Madelaine, and Barnaby Martin.
Quantified constraints and containment problems.
In Proceedings of the Twenty-Third Annual IEEE Symposium on
Logic in Computer Science, pages 317-328. IEEE Computer Society, 2008.
[ .pdf |
Abstract ]
|
|
[C5]
|
Barnaby Martin and Florent Madelaine.
Quantified constraints on directed graphs.
In M. Mohamed J. Daykin and K. Steinhöfel, editors, London
Algorithmics and Stringology 2006, Texts in Algorithmics, page (10 pages).
King's College publication, 2007.
ISBN: 9781904987413.
[ .pdf |
Abstract ]
|
|
[C4]
|
Barnaby Martin and Florent Madelaine.
Hierarchies in fragments of monadic strict NP.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of Lecture
Notes in Computer Science, pages 542-550, 2007.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy.
[ .pdf |
Abstract ]
|
|
[C3]
|
Florent Madelaine.
Universal structures and the logic of forbidden patterns.
In Zoltán Ésik, editor, Computer Science Logic, volume
4207 of Lecture Notes in Computer Science, pages 471-485. Springer,
2006.
Proceedings of the 20th International Workshop, CSL 2006, 15th Annual
Conference of the EACSL, Szeged, Hungary, September 25-29, 2006.
[ .ps |
Abstract ]
|
|
[C2]
|
Stefan Dantchev and Florent Madelaine.
Bounded-degree forbidden-pattern problems are constraint satisfaction
problems.
In Dima Grigoriev, John Harrison, and Edward A. Hirsch, editors,
Computer Science - Theory and Applications, volume 3967 of Lecture
Notes in Computer Science, pages 159-170. Springer, 2006.
Proceedings of the First International Computer Science Symposium in
Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006.
[ .ps.gz |
.ps |
Abstract ]
|
|
[C1]
|
Barnaby Martin and Florent Madelaine.
Towards a trichotomy for quantified H-coloring.
In Arnold Beckmann, Ulrich Berger, Benedikt Löwe, and John V Tucker,
editors, Logical Approaches to Computational Barriers, volume 3988 of
Lecture Notes in Computer Science, pages 342-352, 2006.
Proceedings of the Second Conference on Computability in Europe, CiE
2006, Swansea.
[ .ps.gz |
.ps |
Abstract ]
|
