31 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR3 papers
- Université Blaise PascalFR3 papers
- Université Clermont AuvergneFR3 papers
- Hohai UniversityCN1 paper
- IkerbasqueES1 paper
- Institut PascalFR1 paper
- Laboratoire de Mathématiques Blaise PascalFR1 paper
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR1 paper
- Laboratoire Microorganismes Génome et EnvironnementFR1 paper
- Middlesex University LondonGB1 paper
- Technion – Israel Institute of TechnologyIL1 paper
- Université Paris DiderotFR1 paper
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2013★ 4 cited
Quantified Constraints and Containment Problems
Barnaby D. Martin, Hubie Chen, Florent R. Madelaine
The quantified constraint satisfaction problem is the problem to decide whether a positive Horn sentence, involving nothing more than the two quantifie…
cs.LO2009★ 4 cited
Universal Structures and the logic of Forbidden Patterns
Florent R. Madelaine
Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input is connected and belongs to a class…