Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Abstract. A way for preventing SPA-like attacks on elliptic curve systems is to use the same formula for the doubling and the general addition of points on the curve. Various propo...
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and ...
Giovanni Sambin, Giulia Battilotti, Claudia Faggia...