Sciweavers

1549 search results - page 275 / 310
» On the rules of intermediate logics
Sort
View
20
Voted
JASIS
2000
143views more  JASIS 2000»
13 years 7 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
CADE
2011
Springer
12 years 7 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
WWW
2008
ACM
14 years 8 months ago
Application of bitmap index to information retrieval
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
CADE
2008
Springer
14 years 8 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
CADE
2008
Springer
14 years 8 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard