Publications associées à Formule atomique

Formula Normalizations in Verification

Viktor Kuncak, Simon Guilloud, Mario Bucev, Dragana Milovancevic

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2023

Solving quantified linear arithmetic by counterexample-guided instantiation

Viktor Kuncak, Andrew Joseph Reynolds

This paper presents a framework to derive instantiation-based decision procedures for satisfiability of quantified formulas in first-order theories, including its correctness, implementation, and evaluation. Using this framework we derive decision procedur ...

2017

Disambiguating Discourse Connectives for Statistical Machine Translation

Andrei Popescu-Belis, Thomas Meyer

This paper shows that the automatic labeling of discourse connectives with the relations they signal, prior to machine translation (MT), can be used by phrase-based statistical MT systems to improve their translations. This improvement is demonstrated here ...

2015

On the design of unit-cells for acoustic metasurfaces

Hervé Lissek, Sami Driss Karkar, Seyyed Hussein Seyyed Esfahlani

Acoustic metasurfaces have gained popularity for their capability to tailor the phase front of transmitted and reflected waves. While most of researches conducted in this topic are spinning around different applications and peculiar physics of these surfac ...

IEEE2015

Annotating the meaning of discourse connectives by looking at their translation: The translation-spotting technique

Thomas Meyer

The various meanings of discourse connectives like while and however are difficult to identify and annotate, even for trained human annotators. This problem is all the more important that connectives are salient textual markers of cohesion and need to be c ...

2013

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