Ramón Béjar

72 papers A* 5A 6B 4C 2Misc 1Journal 21Unranked 33
YearRankTypeTitle / Venue / Authors
2024 — conf
Checking Robustness of Neural Network Models for the Classification of Malware.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar, António Morgado, Jordi Planes
2024 J jnl
On the Complexity of the Bipartite Polarization Problem: From Neutral to Highly Polarized Discussions.
Algorithms
Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
2023 — conf
Explainable Machine Learning Models for Predicting COVID-19 Cases in Catalonia Based on Wastewater Monitoring Data.
CCIA
Marc Ribalta, Josep Pueyo-Ros, Lluís Corominas, Ramón Béjar, Carles Mateu, Edgar Rubión
2023 J jnl
On Logic-Based Explainability with Partially Specified Inputs.
CoRR
Ramón Béjar, António Morgado, Jordi Planes, João Marques-Silva
2023 J jnl
On the Complexity of the Bipartite Polarization Problem: from Neutral to Highly Polarized Discussions.
CoRR
Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
2022 — conf
Approximate and Optimal Solutions for the Bipartite Polarization Problem.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
2022 J jnl
Argumentation Reasoning with Graph Isomorphism Networks for Reddit Conversation Analysis.
Int. J. Comput. Intell. Syst.
Teresa Alsinet, Josep Argelich, Ramón Béjar, Daniel Gibert, Jordi Planes
2022 — conf
Combining Support and Attack Interactions for Argumentation Based Discussion Analysis.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar
2021 — conf
Argumentation Reasoning with Graph Neural Networks for Reddit Conversation Analysis.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar, Daniel Gibert, Jordi Planes, Nil Torrent
2021 — conf
Discovering Dominant Users' Opinions in Reddit.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
2020 J jnl
Measuring user relevance in online debates through an argumentative model.
Pattern Recognit. Lett.
Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
2019 J jnl
A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions.
Soft Comput.
Teresa Alsinet, Josep Argelich, Ramón Béjar, Joel Cemeli
2019 — conf
User Profile Analysis in Reddit Debates.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
2018 — conf
A Probabilistic Author-Centered Model for Twitter Discussions.
IPMU (2)
Teresa Alsinet, Josep Argelich, Ramón Béjar, Francesc Esteva, Lluís Godo
2018 — conf
An Argumentation Approach for Agreement Analysis in Reddit Debates.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
2018 J jnl
An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships.
Pattern Recognit. Lett.
Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes
2017 — conf
A Distributed Approach for the Analysis of Discussions in Twitter.
SocInf@IJCAI
Teresa Alsinet, Josep Argelich, Ramón Béjar, Jordi Planes, Joel Cemeli, Cristian Sanahuja
2017 — conf
Author-Centered Argumentation Analysis for Twitter Discussions.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar
2017 J jnl
Weighted argumentation for analysis of discussions in Twitter.
Int. J. Approx. Reason.
Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes
2016 J jnl
Formalisation and logical properties of the maximal ideal recursive semantics for weighted defeasible logic programming.
J. Exp. Theor. Artif. Intell.
Teresa Alsinet, Ramón Béjar, Lluís Godo, Francesc Guitart
2016 J jnl
On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes.
Ann. Math. Artif. Intell.
Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes
2016 J jnl
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics.
J. Log. Comput.
Teresa Alsinet, Ramón Béjar, Lluís Godo, Francesc Guitart
2016 — conf
Support Analysis of Weighted Discussions in Twitter.
CCIA
Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes
2015 J jnl
Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers.
AI Commun.
Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu
2014 — conf
On the Characterization of the Maximal Ideal Recursive Semantics of RP-DeLP.
CCIA
Teresa Alsinet, Ramón Béjar, Lluís Godo, Francesc Guitart
2013 — conf
On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers.
SUM
Teresa Alsinet, David Barroso, Ramón Béjar, Félix Bou, Marco Cerami, Francesc Esteva
2013 — conf
On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation.
SUM
Teresa Alsinet, Ramón Béjar, Lluís Godo, Francesc Guitart
2013 J jnl
On the hardness of solving edge matching puzzles as SAT or CSP problems.
Constraints An Int. J.
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2013 — conf
Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers.
CCIA
Ramón Béjar, Cèsar Fernández, Carles Mateu, Francesc Guitart
2013 — conf
Web Based System for Weighted Defeasible Argumentation.
CLIMA
Teresa Alsinet, Ramón Béjar, Francesc Guitart, Lluís Godo
2012 B conf
Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.
ICTAI
Ramón Béjar, Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri
2012 A* conf
The Automated Vacuum Waste Collection Optimization Problem.
AAAI
Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal
2012 J jnl
The Sudoku completion problem with rectangular hole pattern is NP-complete.
Discret. Math.
Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls
2012 B conf
Using Answer Set Programming for an Scalable Implementation of Defeasible Argumentation.
ICTAI
Teresa Alsinet, Ramón Béjar, Lluís Godo, Francesc Guitart
2011 J jnl
Generating highly balanced sudoku problems as hard problems.
J. Heuristics
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu
2011 — conf
Maximal Ideal Recursive Semantics for Defeasible Argumentation.
SUM
Teresa Alsinet, Ramón Béjar, Lluís Godo, Francesc Guitart
2011 — conf
On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems.
CCIA
Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu
2011 — conf
Towards an Efficient Use of Resources in All-Optical Networks.
CCIA
Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu
2010 — conf
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics.
IBERAMIA
Teresa Alsinet, Ramón Béjar, Lluís Godo
2010 C conf
A characterization of collective conflict for defeasible argumentation.
COMMA
Teresa Alsinet, Ramón Béjar, Lluís Godo
2010 — conf
Encoding Basic Arithmetic Operations for SAT-Solvers.
CCIA
Ramón Béjar, Cèsar Fernández, Francesc Guitart
2010 A conf
Solving Pseudo-Boolean Modularity Constraints.
ECAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu
2009 — conf
A Formal Model of Competence-Based Assessment.
CCIA
Teresa Alsinet, David Barroso, Ramón Béjar, Jordi Planes
2009 — conf
Bounding the Phase Transition on Edge Matching Puzzles.
ISMVL
Ramón Béjar, Cèsar Fernández, Carles Mateu, Nuria Pascual
2009 — conf
Generating Hard Instances for MaxSAT.
ISMVL
Ramón Béjar, Alba Cabiscol, Felip Manyà, Jordi Planes
2008 A conf
Edge Matching Puzzles as Hard SAT/CSP Benchmarks.
CP
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 A conf
From High Girth Graphs to Hard Instances.
CP
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 A* conf
Generating Hard SAT/CSP Instances Using Expander Graphs.
AAAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 Misc conf
Hard SAT and CSP instances with Expander Graphs.
ISAIM
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2008 — conf
How Hard is a Commercial Puzzle: the Eternity II Challenge.
CCIA
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2007 A* conf
On Balanced CSPs with High Treewidth.
AAAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
2007 J jnl
Regular-SAT: A many-valued approach to solving combinatorial problems.
Discret. Appl. Math.
Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes
2006 A* conf
The Impact of Balancing on Problem Hardness in a Highly Structured Domain.
AAAI
Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu
2005 J jnl
Sensor networks and distributed CSP: communication, computation and complexity.
Artif. Intell.
Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bhaskar Krishnamachari, Bart Selman, Magda Valls
2005 A conf
Statistical Modelling of CSP Solving Algorithms Performance.
CP
Ramón Béjar, Cèsar Fernández, Carles Mateu
2004 — conf
The Interface between P and NP in Signed CNF Formulas.
ISMVL
Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà
2003 J jnl
Automated monitoring of medical protocols: a secure and distributed architecture.
Artif. Intell. Medicine
Teresa Alsinet, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Felip Manyà
2003 A* conf
Grid-based SensorDCSP.
IJCAI
Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls
2003 J jnl
On the Complexity of Distributed Self-Configuration in Wireless Networks.
Telecommun. Syst.
Bhaskar Krishnamachari, Stephen B. Wicker, Ramón Béjar, Cèsar Fernández
2002 A conf
Communication and Computation in Distributed CSP Algorithms.
CP
Cèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes
2002 — conf
Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks.
HICSS
Bhaskar Krishnamachari, Ramón Béjar, Stephen B. Wicker
2002 — conf
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.
CCIA
Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà
2001 — conf
A Modular Reduction of Regular Logic to Classical Logic.
ISMVL
Ramón Béjar, Reiner Hähnle, Felip Manyà
2001 A conf
Capturing Structure with Satisfiability.
CP
Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes
2001 J jnl
Extending the Reach of SAT with Many-Valued Logics.
Electron. Notes Discret. Math.
Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes
2001 B conf
Phase transition phenomena in wireless ad hoc networks.
GLOBECOM
Bhaskar Krishnamachari, Stephen B. Wicker, Ramón Béjar
2000 — conf
A Multi-agent system architecture for monitoring medical protocols.
Agents
Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Felip Manyà
2000 — conf
Solving the Round Robin Problem Using Propositional Logic.
AAAI/IAAI
Ramón Béjar, Felip Manyà
1999 — conf
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas.
ESCQARU
Ramón Béjar, Felip Manyà
1999 C conf
Phase Transitions in the Regular Random 3-SAT Problem.
ISMIS
Ramón Béjar, Felip Manyà
1999 B conf
Solving Combinatorial Problems with Regular Local Search Algorithms.
LPAR
Ramón Béjar, Felip Manyà
1998 J jnl
The satisfiability problem in regular CNF-formulas.
Soft Comput.
Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz