Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly ...
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
This paper reports on a system for automated agent negotiation. It uses the JADE agent framework, and its major distinctive feature is the use of declarative negotiation strategie...
Thomas Skylogiannis, Grigoris Antoniou, Nick Bassi...
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...