Computing with relations, functions, and bindings

We present the implementation of the framework in a prolog-like language and show how it is possible to specialize it in a simple and modular way in order to cover different

By forging such a direct link between a proof checking kernel and a logic program, that kernel has access to backtracking search and unification, which means that it can be used

The simultaneous development of similar uses of intuitionistic logic within the logic programming (proof search) setting provided a great deal of confidence that in- tuitionistic

As a result of this unity, the sequent calculus provided logic programming a natural framework in which proof-search could be described for much richer logics (first-order

For example, intuitionistic logic was developed to rid (classical) logic of certain logical principles and model checking

A final lemma reduces strong nor- malization for the system T to strong normalization for SNDM ǫ nat and permits to conclude that system T is normal- izing, as the process of

In this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSSes) and Minimally Unsatisfiable Subformulas (MUSes) of sets of Boolean clauses is intro- duced..

1 The problem of identifying logics is not only of interest for proof theory, but for the whole area of logic, including mathematical logic as well as philosophical logic.. This