default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosep Argelich
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]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. Algorithms 17(8): 369 (2024)- [c33]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
- [i2]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
- [j12]Teresa Alsinet, Josep Argelich, Ramón Béjar, Daniel Gibert, Jordi Planes:
Argumentation Reasoning with Graph Isomorphism Networks for Reddit Conversation Analysis. Int. J. Comput. Intell. Syst. 15(1): 86 (2022) - [c32]Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez:
Approximate and Optimal Solutions for the Bipartite Polarization Problem. CCIA 2022: 17-24 - [c31]Teresa Alsinet, Josep Argelich, Ramón Béjar:
Combining Support and Attack Interactions for Argumentation Based Discussion Analysis. CCIA 2022: 321-324 - 2021
- [j11]Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler:
Clause tableaux for maximum and minimum satisfiability. Log. J. IGPL 29(1): 7-27 (2021) - [c30]Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez:
Discovering Dominant Users' Opinions in Reddit. CCIA 2021: 113-122 - [c29]Teresa Alsinet, Josep Argelich, Ramón Béjar, Daniel Gibert, Jordi Planes, Nil Torrent:
Argumentation Reasoning with Graph Neural Networks for Reddit Conversation Analysis. CCIA 2021: 123-131 - 2020
- [j10]Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez:
Measuring user relevance in online debates through an argumentative model. Pattern Recognit. Lett. 133: 41-47 (2020)
2010 – 2019
- 2019
- [j9]Teresa Alsinet, Josep Argelich, Ramón Béjar, Joel Cemeli:
A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions. Soft Comput. 23(7): 2147-2166 (2019) - [c28]Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez:
User Profile Analysis in Reddit Debates. CCIA 2019: 275-284 - 2018
- [j8]Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships. Pattern Recognit. Lett. 105: 191-199 (2018) - [c27]Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler:
Clause Branching in MaxSAT and MinSAT. CCIA 2018: 17-26 - [c26]Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez:
An Argumentation Approach for Agreement Analysis in Reddit Debates. CCIA 2018: 217-226 - [c25]Teresa Alsinet, Josep Argelich, Ramón Béjar, Francesc Esteva, Lluís Godo:
A Probabilistic Author-Centered Model for Twitter Discussions. IPMU (2) 2018: 683-695 - 2017
- [j7]Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
Weighted argumentation for analysis of discussions in Twitter. Int. J. Approx. Reason. 85: 21-35 (2017) - [c24]Teresa Alsinet, Josep Argelich, Ramón Béjar:
Author-Centered Argumentation Analysis for Twitter Discussions. CCIA 2017: 36-45 - [c23]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 - [c22]Josep Argelich, Chu Min Li, Felip Manyà:
Exploiting Many-Valued Variables in MaxSAT. ISMVL 2017: 155-160 - 2016
- [j6]Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes. Ann. Math. Artif. Intell. 77(1-2): 43-66 (2016) - [c21]Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes:
Support Analysis of Weighted Discussions in Twitter. CCIA 2016: 197-206 - 2014
- [c20]Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu:
Many-Valued MinSAT Solving. ISMVL 2014: 32-37 - 2013
- [c19]Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu:
MinSAT versus MaxSAT for Optimization Problems. CP 2013: 133-142 - 2012
- [j5]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. J. Multiple Valued Log. Soft Comput. 19(1-3): 3-23 (2012) - [c18]Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich:
A New Encoding from MinSAT into MaxSAT. CP 2012: 455-463 - 2011
- [j4]Josep Argelich:
Max-SAT formalisms with hard and soft constraints. AI Commun. 24(1): 101-103 (2011) - [j3]João Marques-Silva, Josep Argelich, Ana Graça, Inês Lynce:
Boolean lexicographic optimization: algorithms & applications. Ann. Math. Artif. Intell. 62(3-4): 317-343 (2011) - [c17]Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu:
On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems. CCIA 2011: 21-30 - [c16]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
Experimenting with the Instances of the MaxSAT Evaluation. CCIA 2011: 31-40 - [c15]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
Analyzing the Instances of the MaxSAT Evaluation. SAT 2011: 360-361 - 2010
- [c14]João Marques-Silva, Josep Argelich, Ana Graça, Inês Lynce:
Boolean Lexicographic Optimization. RCRA@CPAIOR 2010 - [c13]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL 2010: 46-52 - [c12]Josep Argelich, Daniel Le Berre, Inês Lynce, João Marques-Silva, Pascal Rapicault:
Solving Linux Upgradeability Problems Using Boolean Optimization. LoCoCo 2010: 11-22
2000 – 2009
- 2009
- [c11]Josep Argelich, Inês Lynce, João Marques-Silva:
On Solving Boolean Multilevel Optimization Problemse. IJCAI 2009: 393-398 - [c10]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL 2009: 196-202 - [c9]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Sequential Encodings from Max-CSP into Partial Max-SAT. SAT 2009: 161-166 - [i1]Josep Argelich, Inês Lynce, João Marques-Silva:
On Solving Boolean Multilevel Optimization Problems. CoRR abs/0904.0019 (2009) - 2008
- [j2]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
The First and Second Max-SAT Evaluations. J. Satisf. Boolean Model. Comput. 4(2-4): 251-278 (2008) - [c8]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111 - [c7]Josep Argelich, Inês Lynce:
CNF Instances from the Software Package Installation Problem. RCRA 2008 - [c6]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14 - [c5]Josep Argelich, Chu Min Li, Felip Manyà:
A Preprocessor for Max-SAT Solvers. SAT 2008: 15-20 - 2007
- [c4]Josep Argelich, Felip Manyà:
Partial Max-SAT Solvers with Clause Learning. SAT 2007: 28-40 - 2006
- [j1]Josep Argelich, Felip Manyà:
Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12(4-5): 375-392 (2006) - [c3]Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes:
Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26 - 2005
- [c2]Josep Argelich, Felip Manyà:
Solving Over-Constrained Problems with SAT. CP 2005: 838 - [c1]Josep Argelich, Felip Manyà:
Solving Over-Constrained Problems with SAT Technology. SAT 2005: 1-15
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 21:17 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:
