João F. L. Alcântara

Orcid: 0000-0002-4297-2970

Affiliations:
  • Federal University of Ceará, Computer Science Department, Brazil


According to our database1, João F. L. Alcântara authored at least 44 papers between 2002 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Dealing with Inconsistencies in ASPIC<sup>+</sup>.
Proceedings of the Intelligent Systems - 11th Brazilian Conference, 2022

Generalising Semantics to Weighted Bipolar Argumentation Frameworks.
Proceedings of the Intelligent Systems - 11th Brazilian Conference, 2022

2021
A Paraconsistent Approach to Deal with Epistemic Inconsistencies in Argumentation.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2021

Assumption-Based Argumentation Is Logic Programming with Projection.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2021

An Abstract Argumentation and Logic Programming Comparison Based on 5-Valued Labellings.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2021

On the Refinement of Compensation-Based Semantics for Weighted Argumentation Frameworks.
Proceedings of the Intelligent Systems - 10th Brazilian Conference, 2021

ASPIC <sup>?</sup> and the Postulates of Non-interference and Crash-Resistance.
Proceedings of the Intelligent Systems - 10th Brazilian Conference, 2021

A Systematic Approach to Define Semantics for Prioritised Logic Programs.
Proceedings of the Intelligent Systems - 10th Brazilian Conference, 2021

2020
Semantics Hierarchy in Preference-Based Argumentation Frameworks.
Proceedings of the Computational Models of Argument, 2020

Aggregation with Weak, Axiological and Strong Sufficientarian Functions.
Proceedings of the Intelligent Systems - 9th Brazilian Conference, 2020

2019
On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs.
Theory Pract. Log. Program., 2019

Interpretations and models for assumption-based argumentation.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

A Fuzzy Approach for Data Quality Assessment of Linked Datasets.
Proceedings of the 21st International Conference on Enterprise Information Systems, 2019

A Rough Sets-Based Method with Belief Merging Operators for Multiclass Classification Problems.
Proceedings of the 8th Brazilian Conference on Intelligent Systems, 2019

2018
Embedding Remaining Useful Life Predictions into a Modified Receding Horizon Task Assignment Algorithm to Solve Task Allocation Problems.
J. Intell. Robotic Syst., 2018

On Three-Valued Acceptance Conditions of Abstract Dialectical Frameworks.
Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, 2018

An infinite-valued grounded labelling for abstract argumentation frameworks.
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018

Aggregation with T-Norms and LexiT-Orderings and Their Connections with the Leximin Principle.
Proceedings of the Fuzzy Information Processing, 2018

Propositional Belief Merging with OWA Operators.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

A Rough Sets-Based Rule Induction for Numerical Datasets.
Proceedings of the 7th Brazilian Conference on Intelligent Systems, 2018

2016
Sufficientarian Propositional Belief Merging.
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2016

Propositional Belief Merging with T-conorms.
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2016

Reasoning about Trust and Belief in Possibilistic Answer Set Programming.
Proceedings of the 5th Brazilian Conference on Intelligent Systems, 2016

2015
Searching contexts in paraconsistent rough description logic.
J. Braz. Comput. Soc., 2015

On the equivalence between logic programming semantics and argumentation semantics.
Int. J. Approx. Reason., 2015

On the Difference between Assumytion-Based Argumentation and Abstract Argumentation.
FLAP, 2015

Merging Argumentation Systems.
Proceedings of the 2015 Brazilian Conference on Intelligent Systems, 2015

2014
Priority-Based Merging Operator Without Distance Measures.
Proceedings of the Multi-Agent Systems - 12th European Conference, 2014

Private Dynamic Epistemic Friendship Logic.
Proceedings of the 2014 Brazilian Conference on Intelligent Systems, 2014

An ALC Description Default Logic with Exceptions-First.
Proceedings of the 2014 Brazilian Conference on Intelligent Systems, 2014

2013
Preference Handling for Belief-Based Rational Decisions.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

On the Equivalence between Logic Programming Semantics and Argumentation Semantics.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

Searching Contexts in Rough Description Logics.
Proceedings of the Brazilian Conference on Intelligent Systems, 2013

Preferences with qualitative thresholds and methods for individual and collective decisions.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
A Description Logic for InferenceNet.Br.
Proceedings of the Computational Processing of the Portuguese Language, 2012

Cooperative dialogues with conditional arguments.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
Paraconsistent Rough Description Logic.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

Abduction-Based Search for Cooperative Answers.
Proceedings of the Computational Logic in Multi-Agent Systems, 2011

Abduction guided query relaxation.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
A Tractable Paraconsistent Fuzzy Description Logic.
Proceedings of the 6th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2010), 2010

2005
An encompassing framework for Paraconsistent Logic Programs.
J. Appl. Log., 2005

A Well-Founded Semantics with Disjunction.
Proceedings of the Logic Programming, 21st International Conference, 2005

2004
A Declarative Characterization of Disjunctive Paraconsistent Answer Sets.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2002
Paraconsistent Logic Programs.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002


  Loading...