Sciweavers

827 search results - page 11 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
CADE
1994
Springer
13 years 11 months ago
A Completion-Based Method for Mixed Universal and Rigid E-Unification
We present a completion-based method for handling a new version of E-unification, called "mixed" E-unification, that is a combination of the classical "universal&quo...
Bernhard Beckert
AMAI
2002
Springer
13 years 7 months ago
A Complete Axiomatization for Blocks World
Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving jus...
Stephen A. Cook, Yongmei Liu
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 7 months ago
Sound Bisimulations for Higher-Order Distributed Process Calculus
Abstract. While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we develop a bis...
Adrien Piérard, Eijiro Sumii
IAT
2007
IEEE
14 years 1 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
DSSCV
2005
Springer
14 years 1 months ago
From Stochastic Completion Fields to Tensor Voting
Abstract. Several image processing algorithms imitate the lateral interaction of neurons in the visual striate cortex V1 to account for the correlations along contours and lines. H...
Markus van Almsick, Remco Duits, Erik Franken, Bar...