15 search results - page 1 / 3 » Fast Tactic-Based Theorem Proving |
TPHOL
2000
IEEE
13 years 11 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
IJCAI
2003
13 years 8 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
TIT
2002
13 years 6 months ago
2002
This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are "good" in the following sense. For a tur...
ICDM
2006
IEEE
14 years 19 days ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
CTRSA
2005
Springer
14 years 3 days ago
2005
Springer
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability ...