Ramón Béjar

According to our database1, Ramón Béjar authored at least 62 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Measuring user relevance in online debates through an argumentative model.
Pattern Recognit. Lett., 2020

2019
A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions.
Soft Comput., 2019

User Profile Analysis in Reddit Debates.
Proceedings of the Artificial Intelligence Research and Development, 2019

2018
An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships.
Pattern Recognit. Lett., 2018

A Probabilistic Author-Centered Model for Twitter Discussions.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations, 2018

An Argumentation Approach for Agreement Analysis in Reddit Debates.
Proceedings of the Artificial Intelligence Research and Development, 2018

2017
Weighted argumentation for analysis of discussions in Twitter.
Int. J. Approx. Reason., 2017

A Distributed Approach for the Analysis of Discussions in Twitter.
Proceedings of the 3rd International Workshop on Social Influence Analysis co-located with 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), 2017

Author-Centered Argumentation Analysis for Twitter Discussions.
Proceedings of the Recent Advances in Artificial Intelligence Research and Development, 2017

2016
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics.
J. Log. Comput., 2016

Formalisation and logical properties of the maximal ideal recursive semantics for weighted defeasible logic programming.
J. Exp. Theor. Artif. Intell., 2016

On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes.
Ann. Math. Artif. Intell., 2016

Support Analysis of Weighted Discussions in Twitter.
Proceedings of the Artificial Intelligence Research and Development, 2016

2015
Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers.
AI Commun., 2015

2014
On the Characterization of the Maximal Ideal Recursive Semantics of RP-DeLP.
Proceedings of the Artificial Intelligence Research and Development, 2014

2013
On the hardness of solving edge matching puzzles as SAT or CSP problems.
Constraints An Int. J., 2013

On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation.
Proceedings of the Scalable Uncertainty Management - 7th International Conference, 2013

On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers.
Proceedings of the Scalable Uncertainty Management - 7th International Conference, 2013

Web Based System for Weighted Defeasible Argumentation.
Proceedings of the Computational Logic in Multi-Agent Systems, 2013

Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers.
Proceedings of the Artificial Intelligence Research and Development, 2013

2012
The Sudoku completion problem with rectangular hole pattern is NP-complete.
Discret. Math., 2012

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Using Answer Set Programming for an Scalable Implementation of Defeasible Argumentation.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

The Automated Vacuum Waste Collection Optimization Problem.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Generating highly balanced sudoku problems as hard problems.
J. Heuristics, 2011

Maximal Ideal Recursive Semantics for Defeasible Argumentation.
Proceedings of the Scalable Uncertainty Management - 5th International Conference, 2011

Towards an Efficient Use of Resources in All-Optical Networks.
Proceedings of the Artificial Intelligence Research and Development, 2011

On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems.
Proceedings of the Artificial Intelligence Research and Development, 2011

2010
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics.
Proceedings of the Advances in Artificial Intelligence, 2010

Solving Pseudo-Boolean Modularity Constraints.
Proceedings of the ECAI 2010, 2010

A characterization of collective conflict for defeasible argumentation.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

Encoding Basic Arithmetic Operations for SAT-Solvers.
Proceedings of the Artificial Intelligence Research and Development, 2010

2009
Bounding the Phase Transition on Edge Matching Puzzles.
Proceedings of the ISMVL 2009, 2009

Generating Hard Instances for MaxSAT.
Proceedings of the ISMVL 2009, 2009

A Formal Model of Competence-Based Assessment.
Proceedings of the Artificial Intelligence Research and Development, 2009

2008
Hard SAT and CSP instances with Expander Graphs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Edge Matching Puzzles as Hard SAT/CSP Benchmarks.
Proceedings of the Principles and Practice of Constraint Programming, 2008

From High Girth Graphs to Hard Instances.
Proceedings of the Principles and Practice of Constraint Programming, 2008

How Hard is a Commercial Puzzle: the Eternity II Challenge.
Proceedings of the Artificial Intelligence Research and Development, 2008

Generating Hard SAT/CSP Instances Using Expander Graphs.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Regular-SAT: A many-valued approach to solving combinatorial problems.
Discret. Appl. Math., 2007

On Balanced CSPs with High Treewidth.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
The Impact of Balancing on Problem Hardness in a Highly Structured Domain.
Proceedings of the Proceedings, 2006

2005
Sensor networks and distributed CSP: communication, computation and complexity.
Artif. Intell., 2005

Statistical Modelling of CSP Solving Algorithms Performance.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
The Interface between P and NP in Signed CNF Formulas.
Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 2004

2003
On the Complexity of Distributed Self-Configuration in Wireless Networks.
Telecommun. Syst., 2003

Automated monitoring of medical protocols: a secure and distributed architecture.
Artif. Intell. Medicine, 2003

Grid-based SensorDCSP.
Proceedings of the IJCAI-03, 2003

2002
Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks.
Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

Communication and Computation in Distributed CSP Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.
Proceedings of the Topics in Artificial Intelligence, 5th Catalonian Conference on AI, 2002

2001
Extending the Reach of SAT with Many-Valued Logics.
Electron. Notes Discret. Math., 2001

A Modular Reduction of Regular Logic to Classical Logic.
Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

Phase transition phenomena in wireless ad hoc networks.
Proceedings of the Global Telecommunications Conference, 2001

Capturing Structure with Satisfiability.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
A Multi-agent system architecture for monitoring medical protocols.
Proceedings of the Fourth International Conference on Autonomous Agents, 2000

Solving the Round Robin Problem Using Propositional Logic.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Solving Combinatorial Problems with Regular Local Search Algorithms.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Phase Transitions in the Regular Random 3-SAT Problem.
Proceedings of the Foundations of Intelligent Systems, 11th International Symposium, 1999

A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1999

1998
The satisfiability problem in regular CNF-formulas.
Soft Comput., 1998


  Loading...