All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Abstract. This article merges two approaches: one dealing with persistence for logic programs, as provided by a relational database back-end and another which addresses the issues ...
The paper is concerned with the design of a module system for logic programming so as to satisfy many of the requirements of software en gineering. The design is based on the la...
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...