Concept

Logic

Related publications (141)

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.

Machine Translation with Many Manually Labeled Discourse Connectives

Thomas Meyer

The paper presents machine translation experiments from English to Czech with a large amount of manually annotated discourse connectives. The gold-standard discourse relation annotation leads to better translation performance in ranges of 4–60% for some am ...

2013

Translating English Discourse Connectives into Arabic: a Corpus-based Analysis and an Evaluation Metric

Andrei Popescu-Belis

Discourse connectives can often signal multiple discourse relations, depending on their context. The automatic identification of the Arabic translations of seven English discourse connectives shows how these connectives are differently translated depending ...

2012

Closing the Gap between FPGA and ASIC

Hadi Parandeh Afshar

Despite many advantages of Field-Programmable Gate Arrays (FPGAs), they fail to take over the IC design market from Application-Specific Integrated Circuits (ASICs) for high-volume and even medium-volume applications, as FPGAs come with significant cost in ...

EPFL2012

Cutting the fat: Artificial muscle oscillators for lighter, cheaper, and slimmer devices

Herbert Shea, Samuel Rosset

Artificial muscles based on dielectric elastomers show enormous promise for a wide range of applications and are slowly moving from the lab to industry. One problem for industrial uptake is the expensive, rigid, heavy and bulky high voltage driver, sensor ...

SPIE2012

Automatic Verification of Temporal Epistemic Logic under Convergent Equational Theories

We present a methodology for the automatic veriﬁcation of multi-agent systems against temporal-epistemic speciﬁcations derived from higher-level languages deﬁned over convergent equational theories. We introduce a modality called rewriting knowledge that o ...

2012

Logic and Memory Design Based on Unequal Error Protection for Voltage-scalable, Robust and Adaptive DSP Systems

Georgios Karakonstantis

In this paper, we propose a system level design approach considering voltage over-scaling (VOS) that achieves error resiliency using unequal error protection of different computation elements, while incurring minor quality degradation. Depending on user sp ...

Springer US2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

Rigorous Component-Based System Design Using the BIP Framework

Joseph Sifakis

An autonomous robot case study illustrates the use of the behavior, interaction, priority (BIP) component framework as a unifying semantic model to ensure correctness of essential system design properties. ...

Institute of Electrical and Electronics Engineers2011

Decision Procedures for Program Synthesis and Verification

Ruzica Piskac

Decision procedures are widely used in software development and verification. The goal of this dissertation is to increase the scope of properties that can be verified using decision procedures. To achieve this goal, we identify three improvements over the ...

EPFL2011

Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems

Martin Biely

Despite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively sim ...

Springer2011