136 search results - page 22 / 28 » Boolean Formulas and Frequent Sets |
156
click to vote
GECCO
2007
Springer
16 years 7 hour ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
141
click to vote
ICALP
2007
Springer
16 years 4 hour ago
2007
Springer
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
148
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
151
click to vote
PPDP
2000
Springer
15 years 9 months ago
2000
Springer
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
163
click to vote
BVAI
2007
Springer
15 years 7 months ago
2007
Springer
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...