2905 search results - page 105 / 581 » Formal Memetic Algorithms |
ACTA
2007
13 years 10 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
SCP
2000
13 years 9 months ago
2000
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
SAS
2010
Springer
13 years 8 months ago
2010
Springer
ion Refinement Alexander Malkis1 , Andreas Podelski2 , and Andrey Rybalchenko3 1 IMDEA Software 2 University of Freiburg 3 TU M
CADE
2008
Springer
14 years 10 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
ICFCA
2010
Springer
14 years 4 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...