3758 search results - page 81 / 752 » A Complete Subsumption Algorithm |
PODS
2004
ACM
14 years 9 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
ICLP
1995
Springer
14 years 1 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
SIAMCOMP
2008
13 years 9 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
3DIM
2003
IEEE
14 years 3 months ago
2003
IEEE
Motivated by the requirements of the present archaeology, we are developing an automated system for archaeological classification and reconstruction of ceramics. Due to the natur...
AAAI
1998
13 years 11 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...