Sciweavers

286 search results - page 11 / 58
» Weak Ordering - A New Definition
Sort
View
LICS
1999
IEEE
14 years 4 days ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
AAAI
1994
13 years 9 months ago
A Description Classifier for the Predicate Calculus
A description classifier organizes concepts and relations into a taxonomy based on the results of subsumption computations applied to pairs of relation definitions. Until now, des...
Robert M. MacGregor
CSL
2010
Springer
13 years 9 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
FLAIRS
2008
13 years 10 months ago
A New Approach to Heuristic Estimations for Cost-Based Planning
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...
LREC
2008
89views Education» more  LREC 2008»
13 years 9 months ago
Sign Language Corpus Annotation: toward a new Methodology
This paper deals with non manual gestures annotation involved in Sign Language within the context of automatic generation of Sign Language. We will tackle linguistic researches in...
Emilie Chételat-Pelé, Annelies Braff...