The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
This paper shows that a first-order unificationbased semantic interpretation for various coordinate constructs is possible without an explicit use of lambda expressions if we slig...
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
Modern computer systems are based on the traditional hierarchical file system model, but typically contain large numbers of files with complex interrelationships. This tradition...
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...