3 search results - page 1 / 1 » Morphisms of ANN and the Computation of Least Fixed Points o... |
IWINAC
2007
Springer
13 years 10 months ago
2007
Springer
We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequenc...
ICLP
2009
Springer
14 years 5 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
DLT
2006
13 years 6 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...