Sciweavers

1193 search results - page 35 / 239
» A primer of simple theories
Sort
View
APAL
2008
96views more  APAL 2008»
14 years 12 months ago
On superstable CSA-groups
We show that an existentially closed CSA -group is not superstable. We prove that a non-abelian superstable CSA-group has an infinite definable simple subgroup all of whose proper...
Abderezak Ould Houcine
LPNMR
2005
Springer
15 years 5 months ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker
CADE
2007
Springer
16 years 4 days ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
15 years 6 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
NIPS
2007
15 years 1 months ago
Learning and using relational theories
Much of human knowledge is organized into sophisticated systems that are often called intuitive theories. We propose that intuitive theories are mentally represented in a logical ...
Charles Kemp, Noah Goodman, Joshua B. Tenenbaum