We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
Abstract. We propose a logic-based approach to automated oneshot multi-issue bilateral negotiation. We use logic in two ways: (1) a logic theory to represent relations among issues...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
Notions of context for natural language interpretation are factored in terms of three processes: translation, entailment and attunement. The processes are linked by accessibility r...
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...