Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
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...
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Gi...
Abstract. The ability to view extended logic programs as argumentation systems opens the way for the use of this language in formalizing communication among reasoning computing age...