Sciweavers

24 search results - page 3 / 5
» lics 1999
Sort
View
LICS
1999
IEEE
13 years 9 months ago
Concurrent Games and Full Completeness
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It...
Samson Abramsky, Paul-André Melliès
LICS
1999
IEEE
13 years 9 months ago
Extensional Equality in Intensional Type Theory
We present a new approach to introducing an extensional propositional equality in Intensional Type Theory. Our construction is based on the observation that there is a sound, inte...
Thorsten Altenkirch
LICS
1999
IEEE
13 years 9 months ago
Plausibility Measures and Default Reasoning: An Overview
We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as pr...
Joseph Y. Halpern, Nir Friedman
LICS
1999
IEEE
13 years 9 months ago
The Higher-Order Recursive Path Ordering
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
LICS
1999
IEEE
13 years 9 months ago
Entailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
Joachim Niehren, Martin Müller, Jean-Marc Tal...