233 search results - page 20 / 47 » Applications of Polytypism in Theorem Proving |
103
click to vote
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
ICWS
2003
IEEE
15 years 1 months ago
2003
IEEE
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
STOC
2007
ACM
16 years 1 days ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
110
click to vote
ICCAD
2002
IEEE
15 years 8 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
187
click to vote
POPL
2007
ACM
16 years 1 days ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...