450 search results - page 5 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
DAM
1998
13 years 7 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
TFS
2008
13 years 5 months ago
2008
Some errors in our original paper in defining relative reduct with information measures are pointed out in this paper. It is shown that in our original work, Theorems 10 and 19 hol...
MPC
2010
Springer
14 years 7 days ago
2010
Springer
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
JLP
2000
13 years 7 months ago
2000
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
EC
1998
13 years 7 months ago
1998
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, s...