#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2000

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lucas Bordeaux, Eric Monfroy
- CP
- 2002

The generalization of the satisfiability problem with arbitrary quantifiers is a challenging problem of both theoretical and practical relevance. Being PSPACE-complete, it provides a canonical model for solving other PSPACE tasks which naturally arise in AI. Effective SAT-based solvers have been designed very recently for the special case of boolean… (More)

Whether two web services are compatible depends not only on static properties like the correct typing of their message parameters, but also on their dynamic behaviour. Providing a simple description of the service behaviour based on process-algebraic or automata-based formalisms can help detecting many subtle incompatibilities in their interaction.… (More)

- Gwen Salaün, Lucas Bordeaux, Marco Schaerf
- Proceedings. IEEE International Conference on Web…
- 2004

We argue that essential facets of Web services, and especially those useful to understand their interaction, can be described using process-algebraic notations. Web service description and execution languages such as BPEL are essentially process description languages; they are based on primitives for behaviour description and message exchange which can also… (More)

- Carsten Rother, Lucas Bordeaux, Youssef Hamadi, Andrew Blake
- ACM Trans. Graph.
- 2006

The paper defines an automatic procedure for constructing a visually appealing collage from a collection of input images. The aim is that the resulting collage should be representative of the collection, summarising its main themes. It is also assembled largely seamlessly, using graph-cut, Poisson blending of alpha-masks, to hide the joins between input… (More)

- Lucas Bordeaux, Youssef Hamadi, Horst Samulowitz
- IJCAI
- 2009

The computing industry is currently facing a major architectural shift. Extra computing power is not coming anymore from higher processor frequencies, but from a growing number of computing cores and processors. For AI, and constraint solving in particular, this raises the question of how to scale current solving techniques to massively parallel… (More)

- Lucas Bordeaux, Youssef Hamadi, Lintao Zhang
- ACM Comput. Surv.
- 2006

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research cross-fertilizing occasionally. These two approaches to problem solving have a lot in common as evidenced by similar ideas underlying the branch and prune algorithms that are most successful at solving both kinds of problems.… (More)

- Jonathan Taylor, Lucas Bordeaux, +15 authors Jamie Shotton
- ACM Trans. Graph.
- 2016

Fully articulated hand tracking promises to enable fundamentally new interactions with virtual and augmented worlds, but the limited accuracy and efficiency of current systems has prevented widespread adoption. Today's dominant paradigm uses machine learning for initialization and recovery followed by iterative model-fitting optimization to achieve a… (More)

- Lucas Bordeaux, Joao Marques-Silva
- SOFSEM
- 2012

When we encode constraints as Boolean formulas, a natural question is whether the encoding ensures a ”propagation completeness” property: is the basic unit propagation mechanism able to deduce all the literals that are logically valid? We consider the problem of automatically finding encodings with this property. Our goal is to compile a naı̈ve definition… (More)

- Lucas Bordeaux, Marco Cadoli, Toni Mancini
- AAAI
- 2005

Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the simple, classical notion of solution inappropriate. As a consequence, even such essential CSP properties as consistency or substitutability are not completely understood in the… (More)

We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of the presented query algorithms are in the worst case exponential in the tree width, our experiments show that ToB can answer non-trivial queries like clausal entailment in… (More)