Sciweavers

3333 search results - page 99 / 667
» Abstract Proof Search
Sort
View
122
Voted
ICFP
2007
ACM
16 years 3 months ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring
IAT
2007
IEEE
15 years 10 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
119
Voted
JAR
2000
137views more  JAR 2000»
15 years 3 months ago
A Benchmark Method for the Propositional Modal Logics K, KT, S4
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
Peter Balsiger, Alain Heuerding, Stefan Schwendima...
118
Voted
ICFP
2001
ACM
16 years 3 months ago
A Simple Implementation Technique for Priority Search Queues
This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation s...
Ralf Hinze
121
Voted
DMTCS
2002
108views Mathematics» more  DMTCS 2002»
15 years 3 months ago
The height of q-Binary Search Trees
Abstract. q
Michael Drmota, Helmut Prodinger