921 search results - page 89 / 185 » Expressing Computational Complexity in Constructive Type The... |
CCA
2000
Springer
14 years 9 days ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
IANDC
2006
13 years 8 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
IJCAI
2007
13 years 9 months ago
2007
Human intelligence requires decades of full-time training before it can be reliably utilised in modern economies. In contrast, AI agents must be made reliable but interesting in r...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
NIPS
1997
13 years 9 months ago
1997
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...