Concept

Transitive closure

Related publications (25)

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.

On an Efficient Decision Procedure for Imperative Tree Data Structures

Viktor Kuncak

We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invari ...

2011

Expressiveness And Closure Properties For Quantitative Languages

Laurent Doyen

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...

2010

Robotic laser tissue welding of sclera using chitosan films

Eric Tremblay, Pablo Garcia

Purpose: To demonstrate the feasibility of scleral wound closure using a novel adhesive made of chitosan film. Methods: Five-millimeter scleral lacerations were created in enucleated pig eyes. Casted chitosan films were sized to 7×7 mm patches. Lacerations ...

2009

On Linear Arithmetic with Stars

Viktor Kuncak, Ruzica Piskac

We consider an extension of integer linear arithmetic with a star operator that takes closure under vector addition of the set of solutions of linear arithmetic subformula. We show that the satisfiability problem for this language is in NP (and therefore N ...

2008

Expressiveness and Closure Properties for Quantitative Languages

Laurent Doyen

2008

Linear Arithmetic with Stars

Viktor Kuncak, Ruzica Piskac

We consider an extension of integer linear arithmetic with a “star” operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We show that the satisfiability problem for this extended language remains in NP (and th ...

Springer2008

Closure relations for composite bosons: Difference between polaritons and Wannier or Frenkel excitons

Marc-André Dupertuis

We derive the closure relation for N polaritons made of three different types of excitons: bosonized excitons, Frenkel, or Wannier excitons. In the case of polaritons made of Wannier excitons, we show how this closure relation, which appears as nondiagonal ...

2008

Emergent semantics

Philippe Cudré-Mauroux

In the past, the problem of semantic interoperability in information systems was mostly solved by means of centralization, both at a system and at a logical level. This approach has been successful to a certain extent, but offers limited scalability and fl ...

EPFL2007

Belief Propagation on Uncertain Schema Mappings in Peer Data Management Systems

Karl Aberer, Philippe Cudré-Mauroux

Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with the democratization of tools facilitating knowledge elicitation in machine-pro ...

IOSPress2006

Probabilistic Message Passing in Peer Data Management Systems

Karl Aberer, Philippe Cudré-Mauroux

IEEE2006