Sciweavers

2649 search results - page 121 / 530
» Temporal Theories of Reasoning
Sort
View
ECSQARU
2009
Springer
15 years 4 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois
ICFP
2003
ACM
16 years 6 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
LOPSTR
2001
Springer
15 years 11 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
LICS
2000
IEEE
15 years 11 months ago
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
Alan Jeffrey, Julian Rathke
TIME
2000
IEEE
15 years 11 months ago
Towards a Theory of Movie Database Queries
We present a data model for movies and movie databases. A movie is considered to be a 2-dimensional semialgebraic figure that can change in time. We give a number of computabilit...
Bart Kuijpers, Jan Paredaens, Dirk Van Gucht