2920 search results - page 30 / 584 » Finite information logic |
112
click to vote
ICANN
2010
Springer
15 years 27 days ago
2010
Springer
It has been one of the great challenges of neuro-symbolic integration to represent recursive logic programs using neural networks of finite size. In this paper, we propose to imple...
ECCC
2010
14 years 12 months ago
2010
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...
102
click to vote
IJCAI
1993
15 years 1 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
COLING
1994
15 years 1 months ago
1994
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
107
click to vote
DLOG
2011
14 years 3 months ago
2011
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...