Concept

Variable propositionnelle

Publications associées (30)

Multilingual Annotation and Disambiguation of Discourse Connectives for Machine Translation

Many discourse connectives can signal several types of relations between sentences. Their automatic disambiguation, i.e. the labeling of the correct sense of each occurrence is important for discourse parsing, but could also be helpful to machine translati ...

2011

A Corpus-based Contrastive Analysis for Defining Minimal Semantics of Inter-sentential Dependencies for Machine Translation

Andrei Popescu-Belis, Thomas Meyer

Inter-sentential dependencies such as discourse connectives or pronouns have an impact on the translation of these items. These dependencies have classically been analyzed within complex theoretical frameworks, often monolingual ones, and the resulting fin ...

2011

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 ...

Springer2010

Building a Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets ...

Springer2010

Optimizing Variable Ordering of BDDs with Double Hybridized Embryonic Genetic Algorithm.

This paper presents a new double hybridized genetic algorithm for optimizing the variable order in Reduced Ordered Binary Decision Diagrams. The first hybridization adopts embryonic chromosomes as prefixes of variable orders instead of complete variable or ...

2010

Combining Theories with Shared Set Operations

Viktor Kuncak, Ruzica Piskac

Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the theories share set variables and set operations. We prove a combination theore ...

Springer2009

The Role of Tarski’s Declarative Semantics in the Design of Modeling Languages

Alain Wegmann, Andrey Naumenko

This paper focuses on Tarski

s declarative semantics and their usefulness in the design of a modeling language. We introduce the principles behind Tarski

s approach to semantics and explain what advantages this offers in the context of modeling languages. ...

2003

Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems

Boi Faltings, Carlos Eisenberg

Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unsolvability and is thus not suitable for highly constrained or overconstrained ...

Swiss Federal Institute of Technology (EPFL)2003

Observability and Controllability of Piecewise Affine and Hybrid Systems

Giancarlo Ferrari Trecate

In this paper we prove, in a constructive way, the equivalence between piecewise affine systems and a broad class of hybrid systems described by interacting linear dynamics, automata, and propositional logic. By focusing our investigation on the former cla ...

2000

Moving Horizon Estimation for Piecewise Affine Systems

Giancarlo Ferrari Trecate

Many practical control, estimation and fault detection problems involve hybrid systems, here losely defined as systems involving both continuous and discrete variables. Various approaches have been proposed for modeling hybrid systems. Often engineering sy ...

2000

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search