4218 search results - page 197 / 844 » Complete sets of cooperations |
SAS
1991
Springer
14 years 2 months ago
1991
Springer
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
AAAI
2007
14 years 1 months ago
2007
The automated planning community has traditionally focused on the efficient synthesis of plans given a complete domain theory. In the past several years, this line of work met wi...
CCS
2008
ACM
14 years 23 days ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
AAAI
1990
13 years 12 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
MVA
1990
13 years 12 months ago
1990
We describe a method based on the Hough transform to compute a set of parameters that completely describe line segments. By complete, we mean the description includes the endpoint...