We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
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...
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...