828 search results - page 14 / 166 » Bounded Hairpin Completion |
151
click to vote
ENTCS
2007
15 years 5 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
147
click to vote
EVOW
2010
Springer
16 years 1 days ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
188
click to vote
DALT
2005
Springer
15 years 10 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
117
click to vote
JSYML
2008
15 years 5 months ago
2008
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
140
click to vote
ENDM
2007
15 years 5 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...