Sciweavers

3044 search results - page 118 / 609
» Linear logical approximations
Sort
View
ECCC
2007
109views more  ECCC 2007»
13 years 9 months ago
Logic, Graphs, and Algorithms
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
Martin Grohe
ICALP
2010
Springer
13 years 7 months ago
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
Angelo Montanari, Gabriele Puppis, Pietro Sala
DEON
2010
Springer
13 years 10 months ago
A Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
Guillaume Piolle
IEEEMSP
2002
IEEE
167views Multimedia» more  IEEEMSP 2002»
14 years 1 months ago
An experimental study on the performance of visual information retrieval similarity models
–This paper is an experimental study on the performance of the two major methods for macro-level similarity measurement: linear weighted merging and logical retrieval. Performanc...
Horst Eidenberger, Christian Breiteneder
ENTCS
2007
107views more  ENTCS 2007»
13 years 9 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky