4403 search results - page 35 / 881 » Galois Theory of Algorithms |
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
AAAI
2000
15 years 3 months ago
2000
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
104
click to vote
CTCS
1989
Springer
15 years 6 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
129
click to vote
JSYML
2008
15 years 1 months ago
2008
free but not Whitehead Abelian groups to construct Abstract Elementary Classes (AEC) which satisfy the amalgamation property but fail various conditions on the locality of Galois-...
124
click to vote
VMCAI
2007
Springer
15 years 8 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...