Concept

Constraint satisfaction

Related publications (223)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Sets with Cardinality Constraints in Satisfiability Modulo Theories

Viktor Kuncak, Philippe Paul Henri Suter, Robin Steiger

Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that can express constraints on sets of elements and their cardinalities. Problems from verification of complex properties of software often contain fragments that belong to quantifier- ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Entangled queries: enabling declarative data-driven coordination

Christoph Koch

Many data-driven social and Web applications involve collaboration and coordination. The vision of Declarative Data-Driven Coordination (D3C), proposed in Kot et al. [2010], is to support coordination in the spirit of data management: to make it data-centr ...

Assoc Computing Machinery2011

Flexible and Robust Calibration of the Yule-Nielsen Model for CMYK Prints

Thomas Bugnon

Spectral reflection prediction models, although effective, are impractical for certain industrial applications such as self-calibrating devices and online monitoring because of the requirements imposed by their calibration. The idea emerged to make the cal ...

EPFL2011

On Deciding Functional Lists with Sublist Sets

Viktor Kuncak

Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functional lists. We first show how to decide in NP the satisfiability problem for lo ...

2010

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Springer2010

Model-Predictive Control of an Experimental Solid Oxide Fuel Cell Stack

Dominique Bonvin, Stefan Diethelm, Grégory François, Zacharie Wuillemin, Arata Nakajo, Gene Bunin

Solid Oxide Fuel Cells (SOFC) are energy conversion devices that produce electrical energy via the reaction of a fuel with an oxidant. Although SOFCs have become credible alternatives to non-renewable energy sources, efforts are still needed to extend thei ...

2010

Towards unifying diffusion and exemplar-based inpainting

Pierre Vandergheynst, Emmanuel D'Angelo

A novel framework for image inpainting is proposed, relying on graph-based diffusion processes. Depending on the construction of the graph, both flow-based and exemplar-based inpainting methods can be implemented by the same equations, hence providing a un ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Correlative joint definition for motion analysis and animation

Daniel Thalmann, Anders Sandholm

In this paper we address the problem of creating accurate joint models from real motions while allowing scalability. We propose an automatic method to model, scale, and simulate non-idealized joints from the external motion of markers. We demonstrate the m ...

2010

Knowledge based scheduling of distributed systems

Joseph Sifakis

Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems it is hard to find efficient implementations for priorities; because they express c ...

2010