634 search results - page 35 / 127 » Completion Procedures as Semidecision Procedures |
RTA
1991
Springer
14 years 1 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
ICCAD
1996
IEEE
14 years 1 months ago
1996
IEEE
A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead. A probabilistic analysis shows that the output of an LFSR which fee...
TABLEAUX
2009
Springer
14 years 4 months ago
2009
Springer
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...
MIR
2006
ACM
14 years 3 months ago
2006
ACM
The TREC Video Retrieval Evaluation (TRECVid) is an international benchmarking activity to encourage research in video information retrieval by providing a large test collection, ...
AISC
2004
Springer
14 years 3 months ago
2004
Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...