Sciweavers

220 search results - page 17 / 44
» Using Difference Reduction for Generic Proof Search
Sort
View
IAT
2007
IEEE
14 years 2 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
JAR
2000
137views more  JAR 2000»
13 years 7 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...
POPL
2008
ACM
14 years 8 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
CP
2005
Springer
14 years 1 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
ERCIMDL
2010
Springer
150views Education» more  ERCIMDL 2010»
13 years 9 months ago
A Search Log-Based Approach to Evaluation
Abstract. Anyone offering content in a digital library is naturally interested in assessing its performance: how well does my system meet the users' information needs? Standar...
Junte Zhang, Jaap Kamps