9405 search results - page 40 / 1881 » Computing a Model of Set Theory |
CANDC
2009
ACM
15 years 4 months ago
2009
ACM
We present a sub-symbolic computational model for effecting knowledge re-representation and insight. Given a set of data, manifold learning is used to automatically organize the d...
DNA
2006
Springer
15 years 1 months ago
2006
Springer
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
AAAI
1990
14 years 11 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
SC
1992
ACM
15 years 1 months ago
1992
ACM
JELIA
2004
Springer
15 years 3 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...