As the broadband connectivity to the Internet becomes common, Web based e-learning and distance learning have come to play the central roles for self-learning, where learners are given much flexibility in choosing place and time to study. However, the learners still have to spend a lot of time before reaching the learning goal. This discourages the learners from continuing their studies and dim...

We investigate semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms. After illustrating the power of TACLP with some non-trivial examples, TACLP is given two different kinds...

Genetic Parallel Programming (GPP) is a novel Genetic Programming paradigm. GPP Logic Circuit Synthesizer (GPPLCS) is a combinational logic circuit learning system based on GPP. The GPPLCS comprises a MultiLogic-Unit Processor (MLP) which is a hardware processor built on a Field Programmable Gate Array (FPGA). The MLP is designed to speed up the evaluation of genetic parallel programs that repr...

Answer Set Programming (ASP) is a powerful paradigm based on logic programming for non-monotonic reasoning. Current ASP implementations are restricted to “grounded range-restricted function-free normal programs” and use an evaluation strategy that is “bottom-up” (i.e., not goal-driven). Recent introduction of coinductive Logic Programming (co-LP) has allowed the development of topdown goal eval...

Pruning is an eeective method for dealing with noise in Machine Learning. Recently pruning algorithms, in particular Reduced Error Pruning, have also attracted interest in the eld of Inductive Logic Programming. However, it has been shown that these methods can be very ineecient, because most of the time is wasted for generating clauses that explain noisy examples and subsequently pruning these...

The answer set semantics may assign a logic program no model due to classic contradiction or cyclic negation. The latter can be remedied by a paracoherent semantics given by semi-equilibrium (SEQ) models, which are 3-valued interpretations that generalize the logical reconstruction of answer sets given by equilibrium models. However SEQ-models miss modularity in the rules, such that a natural m...

This paper describes a new method for inducing logic programs from examples which attempts to integrate the best aspects of existing ILP methods into a single coherent framework. In particular, it combines a bottomup method similar to Golem with a topdown method similar to Foil. It also includes a method for predicate invention similar to Champ and an elegant solution to the \noisy oracle" prob...

We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. \Generalized semantics" abstract away from standard semantics objects, by focusing on the general properties of any (possibly non-standard) semantics deenition. In constraint logic programming, this corresponds to a suitable deeni...