Sciweavers

842 search results - page 39 / 169
» Linear logic
Sort
View
IANDC
2007
127views more  IANDC 2007»
13 years 9 months ago
Temporal logics with incommensurable distances are undecidable
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
Alexander Rabinovich
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 9 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
FSTTCS
2004
Springer
14 years 2 months ago
Who is Pointing When to Whom?
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
Dino Distefano, Joost-Pieter Katoen, Arend Rensink
TIME
2002
IEEE
14 years 2 months ago
A Logical Approach to Represent and Reason about Calendars
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
Carlo Combi, Massimo Franceschet, Adriano Peron
WG
1998
Springer
14 years 1 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics