In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
In this paper we carry out an algebraic investigation of the Weak Nilpotent Minimum logic (WNM) and its t-norm based axiomatic extensions. We consider the algebraic counterpart of...
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...