enter search term and/or author name
PELCR: Parallel environment for optimal lambda-calculus reduction
Marco Pedicini, Francesco Quaglia
Article No.: 14
In this article we present the implementation of an environment supporting Lévy's optimal reduction for the λ-calculus on parallel (or distributed) computing systems. In a similar approach to Lamping's, we base our work on a...
This is the second in a series of three articles extending the proof of the Abstract State Machine Thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments...
This is the third in a series of three articles extending the proof of the Abstract State Machine thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments...
Semantical characterizations and complexity of equivalences in answer set programming
Thomas Eiter, Michael Fink, Stefan Woltran
Article No.: 17
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P∪R and Q∪R have the same answer sets...
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
Article No.: 18
We introduce a uniform approach of representing a variety of paraconsistent nonmonotonic formalisms by quantified Boolean formulae (QBFs) in the context of multiple-valued logics. We show that this framework provides a useful platform for...