Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
The mathematics of belief functions can be handled with the use of the matrix notation. This representation helps greatly the user thanks to its notational simplicity and its effi...
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when in...
Ivan Lanese, Francisco Martins, Vasco Thudichum Va...