2529 search results - page 157 / 506 » The Logical Structure of Binding |
138
click to vote
APAL
2008
15 years 7 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
223
click to vote
ENTCS
2007
15 years 6 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
178
click to vote
TCAD
1998
15 years 6 months ago
1998
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
177
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper introduces a foundation for inductive learning based on the use of higher-order logic for knowledge representation. In particular, the paper (i) provides a systematic i...
215
click to vote
BTW
2007
Springer
16 years 1 months ago
2007
Springer
: Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the tran...