Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
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 paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...