In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for temporal synthesis, l...
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
Javier Larrosa, Albert Oliveras, Enric Rodrí...
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
Antonina Kolokolova, Yongmei Liu, David G. Mitchel...