We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
This paper integrates research in robot programming and reasoning about action with research in model-based reasoning about physical systems to provide a capability for modeling an...
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...