24 search results - page 2 / 5 » Automatic Generation of Classification Theorems for Finite A... |
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
84
Voted
JSYML
2006
14 years 11 months ago
2006
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
55
Voted
IJCAI
1993
15 years 28 days ago
1993
83
Voted
JSYML
2008
14 years 11 months ago
2008
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
CP
2000
Springer
15 years 4 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...