Sciweavers

8094 search results - page 71 / 1619
» Improvements in Formula Generalization
Sort
View
ITS
2010
Springer
163views Multimedia» more  ITS 2010»
13 years 11 months ago
Correcting Scientific Knowledge in a General-Purpose Ontology
General-purpose ontologies (e.g. WordNet) are convenient, but they are not always scientifically valid. We draw on techniques from semantic class learning to improve the scientific...
Michael Lipschultz, Diane J. Litman
SAT
2004
Springer
131views Hardware» more  SAT 2004»
14 years 2 months ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
ACL2
2006
ACM
14 years 24 days ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray
ENTCS
2007
80views more  ENTCS 2007»
13 years 9 months ago
Topological Perspective on the Hybrid Proof Rules
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Balder ten Cate, Tadeusz Litak
JCP
2010
100views more  JCP 2010»
13 years 7 months ago
Provable Secure Generalized Signcryption
Generalized signcryption which proposed by Han is a new cryptographic primitive which can work as an encryption scheme, a signature scheme or a signcryption scheme [5]. However,the...
Xu An Wang, Xiaoyuan Yang, Jindan Zhang