default search action
Ramón Béjar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Teresa Alsinet
, Josep Argelich
On the Complexity of the Bipartite Polarization Problem: From Neutral to Highly Polarized Discussions. Algorithms 17(8): 369 (2024) - [c51]Teresa Alsinet, Josep Argelich, Ramón Béjar, António Morgado, Jordi Planes:
Checking Robustness of Neural Network Models for the Classification of Malware. CCIA 2024: 101-108 - 2023
- [c50]Marc Ribalta, Josep Pueyo-Ros, Lluís Corominas, Ramón Béjar, Carles Mateu, Edgar Rubión:
Explainable Machine Learning Models for Predicting COVID-19 Cases in Catalonia Based on Wastewater Monitoring Data. CCIA 2023: 262-266 - [i2]Ramón Béjar, António Morgado, Jordi Planes, João Marques-Silva:
On Logic-Based Explainability with Partially Specified Inputs. CoRR abs/2306.15803 (2023) - [i1]Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez:
On the Complexity of the Bipartite Polarization Problem: from Neutral to Highly Polarized Discussions. CoRR abs/2307.11621 (2023) - 2022
- [j18]Teresa Alsinet
Argumentation Reasoning with Graph Isomorphism Networks for Reddit Conversation Analysis. Int. J. Comput. Intell. Syst. 15(1): 86 (2022) - [c49]Teresa Alsinet, Josep Argelich
Approximate and Optimal Solutions for the Bipartite Polarization Problem. CCIA 2022: 17-24 - [c48]Teresa Alsinet, Josep Argelich
Combining Support and Attack Interactions for Argumentation Based Discussion Analysis. CCIA 2022: 321-324 - 2021
- [c47]Teresa Alsinet, Josep Argelich
Discovering Dominant Users' Opinions in Reddit. CCIA 2021: 113-122 - [c46]Teresa Alsinet, Josep Argelich
Argumentation Reasoning with Graph Neural Networks for Reddit Conversation Analysis. CCIA 2021: 123-131 - 2020
- [j17]Teresa Alsinet
Measuring user relevance in online debates through an argumentative model. Pattern Recognit. Lett. 133: 41-47 (2020)
2010 – 2019
- 2019
- [j16]Teresa Alsinet
A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions. Soft Comput. 23(7): 2147-2166 (2019) - [c45]Teresa Alsinet, Josep Argelich
User Profile Analysis in Reddit Debates. CCIA 2019: 275-284 - 2018
- [j15]Teresa Alsinet
An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships. Pattern Recognit. Lett. 105: 191-199 (2018) - [c44]Teresa Alsinet
An Argumentation Approach for Agreement Analysis in Reddit Debates. CCIA 2018: 217-226 - [c43]Teresa Alsinet
A Probabilistic Author-Centered Model for Twitter Discussions. IPMU (2) 2018: 683-695 - 2017
- [j14]Teresa Alsinet
Weighted argumentation for analysis of discussions in Twitter. Int. J. Approx. Reason. 85: 21-35 (2017) - [c42]Teresa Alsinet
Author-Centered Argumentation Analysis for Twitter Discussions. CCIA 2017: 36-45 - [c41]Teresa Alsinet, Josep Argelich, Ramón Béjar, Jordi Planes, Joel Cemeli, Cristian Sanahuja:
A Distributed Approach for the Analysis of Discussions in Twitter. SocInf@IJCAI 2017: 45-56 - 2016
- [j13]Josep Argelich
On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes. Ann. Math. Artif. Intell. 77(1-2): 43-66 (2016) - [j12]Teresa Alsinet
Formalisation and logical properties of the maximal ideal recursive semantics for weighted defeasible logic programming. J. Exp. Theor. Artif. Intell. 28(1-2): 275-294 (2016) - [j11]Teresa Alsinet
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics. J. Log. Comput. 26(4): 1315-1360 (2016) - [c40]Teresa Alsinet
Support Analysis of Weighted Discussions in Twitter. CCIA 2016: 197-206 - 2015
- [j10]Teresa Alsinet
Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers. AI Commun. 28(1): 21-34 (2015) - 2014
- [c39]Teresa Alsinet
On the Characterization of the Maximal Ideal Recursive Semantics of RP-DeLP. CCIA 2014: 215-224 - 2013
- [j9]Carlos Ansótegui
On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints An Int. J. 18(1): 7-37 (2013) - [c38]Ramón Béjar
Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers. CCIA 2013: 60-63 - [c37]Teresa Alsinet, Ramón Béjar, Francesc Guitart
Web Based System for Weighted Defeasible Argumentation. CLIMA 2013: 155-171 - [c36]Teresa Alsinet, Ramón Béjar, Lluís Godo
On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation. SUM 2013: 71-77 - [c35]Teresa Alsinet, David Barroso, Ramón Béjar, Félix Bou, Marco Cerami, Francesc Esteva:
On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers. SUM 2013: 325-330 - 2012
- [j8]Ramón Béjar
The Sudoku completion problem with rectangular hole pattern is NP-complete. Discret. Math. 312(22): 3306-3315 (2012) - [c34]Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal:
The Automated Vacuum Waste Collection Optimization Problem. AAAI 2012: 264-266 - [c33]Ramón Béjar
Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. ICTAI 2012: 291-298 - [c32]Teresa Alsinet
Using Answer Set Programming for an Scalable Implementation of Defeasible Argumentation. ICTAI 2012: 1016-1021 - 2011
- [j7]Carlos Ansótegui
Generating highly balanced sudoku problems as hard problems. J. Heuristics 17(5): 589-614 (2011) - [c31]Josep Argelich
On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems. CCIA 2011: 21-30 - [c30]Ramón Béjar
Towards an Efficient Use of Resources in All-Optical Networks. CCIA 2011: 61-70 - [c29]Teresa Alsinet
Maximal Ideal Recursive Semantics for Defeasible Argumentation. SUM 2011: 96-109 - 2010
- [c28]Ramón Béjar
Encoding Basic Arithmetic Operations for SAT-Solvers. CCIA 2010: 239-248 - [c27]Teresa Alsinet
A characterization of collective conflict for defeasible argumentation. COMMA 2010: 27-38 - [c26]Carlos Ansótegui
Solving Pseudo-Boolean Modularity Constraints. ECAI 2010: 867-872 - [c25]Teresa Alsinet
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics. IBERAMIA 2010: 40-49
2000 – 2009
- 2009
- [c24]Teresa Alsinet
A Formal Model of Competence-Based Assessment. CCIA 2009: 428-436 - [c23]Ramón Béjar
Bounding the Phase Transition on Edge Matching Puzzles. ISMVL 2009: 80-85 - [c22]Ramón Béjar
Generating Hard Instances for MaxSAT. ISMVL 2009: 191-195 - 2008
- [c21]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
Generating Hard SAT/CSP Instances Using Expander Graphs. AAAI 2008: 1442-1443 - [c20]Carlos Ansótegui
How Hard is a Commercial Puzzle: the Eternity II Challenge. CCIA 2008: 99-108 - [c19]Carlos Ansótegui
From High Girth Graphs to Hard Instances. CP 2008: 298-312 - [c18]Carlos Ansótegui
Edge Matching Puzzles as Hard SAT/CSP Benchmarks. CP 2008: 560-565 - [c17]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
Hard SAT and CSP instances with Expander Graphs. ISAIM 2008 - 2007
- [j6]Ramón Béjar
Regular-SAT: A many-valued approach to solving combinatorial problems. Discret. Appl. Math. 155(12): 1613-1626 (2007) - [c16]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu:
On Balanced CSPs with High Treewidth. AAAI 2007: 161-166 - 2006
- [c15]Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu:
The Impact of Balancing on Problem Hardness in a Highly Structured Domain. AAAI 2006: 10-15 - 2005
- [j5]Ramón Béjar
Sensor networks and distributed CSP: communication, computation and complexity. Artif. Intell. 161(1-2): 117-147 (2005) - [c14]Ramón Béjar, Cèsar Fernández, Carles Mateu
Statistical Modelling of CSP Solving Algorithms Performance. CP 2005: 861 - 2004
- [c13]Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà:
The Interface between P and NP in Signed CNF Formulas. ISMVL 2004: 251-256 - 2003
- [j4]Teresa Alsinet
Automated monitoring of medical protocols: a secure and distributed architecture. Artif. Intell. Medicine 27(3): 367-392 (2003) - [j3]Bhaskar Krishnamachari, Stephen B. Wicker, Ramón Béjar
On the Complexity of Distributed Self-Configuration in Wireless Networks. Telecommun. Syst. 22(1-4): 33-59 (2003) - [c12]Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls:
Grid-based SensorDCSP. IJCAI 2003: 1359-1361 - 2002
- [c11]Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà:
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. CCIA 2002: 139-144 - [c10]Cèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes:
Communication and Computation in Distributed CSP Algorithms. CP 2002: 664-679 - [c9]Bhaskar Krishnamachari, Ramón Béjar
Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks. HICSS 2002: 297 - 2001
- [j2]Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
Extending the Reach of SAT with Many-Valued Logics. Electron. Notes Discret. Math. 9: 392-407 (2001) - [c8]Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
Capturing Structure with Satisfiability. CP 2001: 137-152 - [c7]Bhaskar Krishnamachari, Stephen B. Wicker, Ramón Béjar:
Phase transition phenomena in wireless ad hoc networks. GLOBECOM 2001: 2921-2925 - [c6]Ramón Béjar
A Modular Reduction of Regular Logic to Classical Logic. ISMVL 2001: 221-226 - 2000
- [b1]Ramón Béjar Torres:
Systematic and local search algorithms for regular-SAT. Autonomous University of Barcelona, Spain, 2000 - [c5]Ramón Béjar, Felip Manyà:
Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI 2000: 262-266 - [c4]Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Felip Manyà:
A Multi-agent system architecture for monitoring medical protocols. Agents 2000: 499-505
1990 – 1999
- 1999
- [c3]Ramón Béjar, Felip Manyà:
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. ESCQARU 1999: 22-31 - [c2]Ramón Béjar
Phase Transitions in the Regular Random 3-SAT Problem. ISMIS 1999: 292-300 - [c1]Ramón Béjar, Felip Manyà:
Solving Combinatorial Problems with Regular Local Search Algorithms. LPAR 1999: 33-43 - 1998
- [j1]Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz:
The satisfiability problem in regular CNF-formulas. Soft Comput. 2(3): 116-123 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: