The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...