Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how frames provide a uniform treatment for semantic proofs of cut-elimination, the finite model property and the fin...

Semantic understanding of urban street scenes through visual perception has been widely studied due to many possible practical applications. Key challenges arise from the high visual complexity of such scenes. In this paper, we present ongoing work on a new large-scale dataset for (1) assessing the performance of vision algorithms for different tasks of semantic urban scene understanding, inclu...

According to Barsalou (1992) frames as recursive attribute-value structures form the general format of cognitive concepts. Based on empirical research, Barsalou’s focus in developing frame theory was not on providing a formal theory. Our project proposes to both sharpen and generalize his intuitive conceptions by developing an adequate formal model for frames. Our goal is to obtain a better und...

In [12] the study of Positive Modal Logic (PML) is initiated using standard Kripke semantics and the positive modal algebras (a class of bounded distributive lattices with modal operators) are introduced. The minimum system of Positive Modal Logic is the (∧,∨, 2, 3,⊥,>)-fragment of the local consequence relation defined by the class of all Kripke models. It can be axiomatized by a sequent calcu...

Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Principles of weak negation are shown to be isolable, thus defining a number of subminimal negations in the B+ context. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames) without extending t...

Most methodologies for static program verification support recursively-defined predicates in specifications, in order to reason about recursive data structures. Intuitively, a predicate instance represents the complete unrolling of its definition; this is the equirecursive interpretation. However, this semantics is unsuitable for static verification, when the recursion becomes unbounded. For th...

In the present paper, we introduce bounded morphisms on bi-approximation semantics, show the so-called p-morphism lemma on bi-approximation semantics, and investigate the dual representation of the morphisms. In addition, we study three properties, namely B-embedding, B-separating and B-reflecting, to preserve validity of sequents on frames. These bounded morphisms do not look like embedding, s...

State-of-the-art video deblurring methods cannot handle blurry videos recorded in dynamic scenes, since they are built under a strong assumption that the captured scenes are static. Contrary to the existing methods, we propose a video deblurring algorithm that can deal with general blurs inherent in dynamic scenes. To handle general and locally varying blurs caused by various sources, such as m...

The ModelCamera is a system for inside-looking-out modeling of static, room-size indoor scenes. The ModelCamera implements an interactive modeling pipeline based on real-time dense color and sparse depth. The operator scans the scene with a device that acquires a video stream augmented with 49 depth samples per frame. The system registers the frames using the depth and color data, and integrate...

We report that color and depth, as well as form, are recovered in tandem with seeing motion. The stimulus, consisting of multiple frames, was designed to keep all aspects, except color, of the binocular images identical. In still view, rivalry occurs due to the unmatched color of some corresponding image elements in the two eyes. When frames--created by translating color assignments and nothing...