We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis