154 search results - page 10 / 31 » PAC-Learnability of Determinate Logic Programs |
IWINAC
2007
Springer
14 years 4 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...
PPDP
2007
Springer
14 years 4 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
CSFW
2007
IEEE
14 years 4 months ago
2007
IEEE
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
FUZZIEEE
2007
IEEE
14 years 4 months ago
2007
IEEE
— Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. It is well known that the choice of the fuzzy operat...
JFP
2000
13 years 9 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...