Sciweavers

27 search results - page 2 / 6
» Dependency Calculus: Reasoning in a General Point Relation A...
Sort
View
CSL
2010
Springer
13 years 6 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
TIME
1994
IEEE
13 years 9 months ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
IJAR
2008
98views more  IJAR 2008»
13 years 4 months ago
Fuzzy region connection calculus: Representing vague topological information
Qualitative spatial information plays a key role in many applications. While it is well-recognized that all but a few of these applications deal with spatial information that is a...
Steven Schockaert, Martine De Cock, Chris Cornelis...
CSL
2007
Springer
13 years 11 months ago
Not Enough Points Is Enough
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzon...
LPAR
2005
Springer
13 years 10 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...