Ramón Béjar

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints 18(1): 7-37 (2013)

Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls: The Sudoku completion problem with rectangular hole pattern is NP-complete. Discrete Mathematics 312(22): 3306-3315 (2012)

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

Ramón Béjar, Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri: Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. ICTAI 2012: 291-298

Teresa Alsinet, Ramón Béjar, Lluis Godo, Francesc Guitart: Using Answer Set Programming for an Scalable Implementation of Defeasible Argumentation. ICTAI 2012: 1016-1021

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu: Generating highly balanced sudoku problems as hard problems. J. Heuristics 17(5): 589-614 (2011)

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

Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu: Towards an Efficient Use of Resources in All-Optical Networks. CCIA 2011: 61-70

Teresa Alsinet, Ramón Béjar, Lluis Godo, Francesc Guitart: Maximal Ideal Recursive Semantics for Defeasible Argumentation. SUM 2011: 96-109

Ramón Béjar, Cèsar Fernández, Francesc Guitart: Encoding Basic Arithmetic Operations for SAT-Solvers. CCIA 2010: 239-248

Teresa Alsinet, Ramón Béjar, Lluis Godo: A characterization of collective conflict for defeasible argumentation. COMMA 2010: 27-38

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu: Solving Pseudo-Boolean Modularity Constraints. ECAI 2010: 867-872

Teresa Alsinet, Ramón Béjar, Lluis Godo: A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics. IBERAMIA 2010: 40-49

Teresa Alsinet, David Barroso, Ramón Béjar, Jordi Planes: A Formal Model of Competence-Based Assessment. CCIA 2009: 428-436

Ramón Béjar, Cèsar Fernández, Carles Mateu, Nuria Pascual: Bounding the Phase Transition on Edge Matching Puzzles. ISMVL 2009: 80-85

Ramón Béjar, Alba Cabiscol, Felip Manyà, Jordi Planes: Generating Hard Instances for MaxSAT. ISMVL 2009: 191-195

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

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: How Hard is a Commercial Puzzle: the Eternity II Challenge. CCIA 2008: 99-108

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: From High Girth Graphs to Hard Instances. CP 2008: 298-312

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: Edge Matching Puzzles as Hard SAT/CSP Benchmarks. CP 2008: 560-565

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: Hard SAT and CSP instances with Expander Graphs. ISAIM 2008

Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes: Regular-SAT: A many-valued approach to solving combinatorial problems. Discrete Applied Mathematics 155(12): 1613-1626 (2007)

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: On Balanced CSPs with High Treewidth. AAAI 2007: 161-166

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

Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bhaskar Krishnamachari, Bart Selman, Magda Valls: Sensor networks and distributed CSP: communication, computation and complexity. Artif. Intell. 161(1-2): 117-147 (2005)

Ramón Béjar, Cèsar Fernández, Carles Mateu: Statistical Modelling of CSP Solving Algorithms Performance. CP 2005: 861

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

Teresa Alsinet, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Felip Manyà: Automated monitoring of medical protocols: a secure and distributed architecture. Artificial Intelligence in Medicine 27(3): 367-392 (2003)

Bhaskar Krishnamachari, Stephen B. Wicker, Ramón Béjar, Cèsar Fernández: On the Complexity of Distributed Self-Configuration in Wireless Networks. Telecommunication Systems 22(1-4): 33-59 (2003)

Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls: Grid-based SensorDCSP. IJCAI 2003: 1359-1361

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

Cèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes: Communication and Computation in Distributed CSP Algorithms. CP 2002: 664-679

Bhaskar Krishnamachari, Ramón Béjar, Stephen B. Wicker: Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks. HICSS 2002: 297

Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Extending the Reach of SAT with Many-Valued Logics. Electronic Notes in Discrete Mathematics 9: 392-407 (2001)

Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Capturing Structure with Satisfiability. CP 2001: 137-152

Ramón Béjar, Reiner Hähnle, Felip Manyà: A Modular Reduction of Regular Logic to Classical Logic. ISMVL 2001: 221-226

Ramón Béjar, Felip Manyà: Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI 2000: 262-266

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

Ramón Béjar, Felip Manyà: A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. ESCQARU 1999: 22-31

Ramón Béjar, Felip Manyà: Phase Transitions in the Regular Random 3-SAT Problem. ISMIS 1999: 292-300

Ramón Béjar, Felip Manyà: Solving Combinatorial Problems with Regular Local Search Algorithms. LPAR 1999: 33-43

Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz: The satisfiability problem in regular CNF-formulas. Soft Comput. 2(3): 116-123 (1998)