42 search results - page 6 / 9 » Condensed Representations for Inductive Logic Programming |
CAEPIA
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...
LPNMR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
IJCAI
2007
13 years 8 months ago
2007
Reasoning about the past is of fundamental importance in several applications in computer science and artificial intelligence, including reactive systems and planning. In this pa...
TCS
2011
13 years 2 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
SEMWEB
2009
Springer
14 years 1 months ago
2009
Springer
Probabilistic Description Logics are the basis of ontologies in the Semantic Web. Knowledge representation and reasoning for these logics have been extensively explored in the last...