Within ILP, the concepts to be learned are normally considered as being succinctly representable in rst-order logic. In a previous paper the authors demonstrated that increased predictive accuracy can be achieved by employing higher-order logic (HOL) in the background knowledge. In this paper, the exible higher-order Horn clauses (FHOHC) framework is introduced. It is more expressive than the f...

This note corrects some errors and misprints in Napp, Rapisarda, and Rocha (2011). The condition for time-relevant stability given in Theorem 10 is sufficient, but not necessary. Therefore the following changes should be made. In the statement of Theorem 10, ‘‘if and only if’’ should be replaced by ‘‘if’’. In the proof of the ‘‘if’’ part of this theorem, the sentence ‘‘In order to do this, sinc...

In recent times, there has been an increase in the number of Natural Language Generation systems that take into consideration a user’s inferences. The statements generated by these systems are typically connected by inferential links, which are opportunistic in nature. In this paper, we describe a discourse structuring mechanism which organizes inferentially linked statements as well as stateme...

The work investigates the logic underlying the representation of the non-regulative component of normative systems, the so-called counts-as. The analytic thesis we hold here is to view counts-as statements as statements which yield classifications and which hold only with respect to a context. These two aspects of the semantics of counts-as -the classificatory flavor, and the contextual charact...

TRACX (French, Addyman, & Mareschal, 2011) is a recursive connectionist system that implicitly extracts chunks from sequence data. It can account for experiments on infant statistical learning and adult implicit learning, as well as realworld phoneme data, and an experiment using backward transitional probabilities that simple recurrent networks cannot account for. One criticism of TRACX, howev...

This research describes the formalization of statements of the form fact f is irrelevant to fact g given theory M. We motivate the need for representing and reasoning wi th such statements in problem-solving systems, and outline the semantics and properties of statements about irrelevance. We then describe a logic irrelevance that serves as a language for specifying irrelevance claims in the wo...