Samy Sá
Federal University of Ceará
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Samy Sá.
european conference on symbolic and quantitative approaches to reasoning and uncertainty | 2013
Martinus Wigbertus Antonius Caminada; Samy Sá; João Alcântara
In this paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We note that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) can serve as a basis for describing various equivalences between logic programming semantics and argumentation semantics. In particular, we are able to provide a formal connection between regular semantics for logic programming and preferred semantics for formal argumentation. We also show that there exist logic programming semantics (L-stable semantics) that cannot be captured by any abstract argumentation semantics.
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems | 2011
Samy Sá; João Alcântara
We propose that agents may use abductive reasoning to adopt a Cooperative Answering behavior. In the event of failure or inadequacy of answers to a query (question), the agent should provide related answers by employing Query Relaxation. These answers are to be related to the query and might be useful to the querying agent. In order to achieve that, we consider agents with knowledge bases consisting of Abductive Logic Programs. Such agents are able to explain failure and guide the search for related answers. A distinctive aspect of our proposal is that in order to avoid undesirable results, one can select the parts of the query that cannot be relaxed.
acm symposium on applied computing | 2018
João Alcântara; Samy Sá
This paper introduces a purely model-theoretic characterisation of a labelling-based semantics for argumentation frameworks. The meaning of such framework is determined declaratively by their unique minimum model (which is guaranteed to exist) or equivalently by a kind of immediate consequences operator. The distinctive aspect of our semantics is that it is settled on an infinite-valued approach. Indeed, we prove that it reduces to the grounded semantics when collapsed to a three-valued scenario.
FLAP | 2013
Martinus Wigbertus Antonius Caminada; Samy Sá; João Alcântara; Wolfgang Dvořák
adaptive agents and multi agents systems | 2012
Samy Sá; João Alcântara
adaptive agents and multi agents systems | 2011
Samy Sá
international conference on logic programming | 2013
Samy Sá; João Alcântara
adaptive agents and multi agents systems | 2013
Samy Sá
adaptive agents and multi agents systems | 2013
Samy Sá; João Alcântara
adaptive agents and multi agents systems | 2011
Samy Sá; João Alcântara