Publicaciones en las que colabora con RAMON BEJAR TORRES (36)

2018

  1. An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships

    Pattern Recognition Letters, Vol. 105, pp. 191-199

2017

  1. Weighted argumentation for analysis of discussions in Twitter

    International Journal of Approximate Reasoning, Vol. 85, pp. 21-35

2016

  1. On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes

    Annals of Mathematics and Artificial Intelligence, Vol. 77, Núm. 1-2, pp. 43-66

  2. Support analysis of weighted discussions in twitter

    Frontiers in Artificial Intelligence and Applications

2015

  1. Solving the routing and wavelength assignment problem with conflict-driven ASP solvers

    AI Communications

2013

  1. On the hardness of solving edge matching puzzles as SAT or CSP problems

    Constraints, Vol. 18, Núm. 1, pp. 7-37

  2. Solving routing and wavelength assignment problem with conflict-driven asp solvers

    Frontiers in Artificial Intelligence and Applications

2012

  1. Optimizing energy consumption in automated vacuum waste collection systems

    Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

  2. The Automated Vacuum Waste Collection Optimization Problem

    Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI 2012

  3. The Sudoku completion problem with rectangular hole pattern is NP-complete

    Discrete Mathematics, Vol. 312, Núm. 22, pp. 3306-3315

  4. The automated vacuum waste collection optimization problem

    Proceedings of the National Conference on Artificial Intelligence

2011

  1. Generating highly balanced sudoku problems as hard problems

    Journal of Heuristics, Vol. 17, Núm. 5, pp. 589-614

  2. On 2SAT-maxones with unbalanced polarity: From easy problems to hard MaxClique problems

    Frontiers in Artificial Intelligence and Applications

  3. Towards an efficient use of resources in all-optical networks

    Frontiers in Artificial Intelligence and Applications

2010

  1. Encoding basic arithmetic operations for SAT-solvers

    Frontiers in Artificial Intelligence and Applications

  2. Solving Pseudo-Boolean modularity constraints

    Frontiers in Artificial Intelligence and Applications

2009

  1. Bounding the phase transition on edge matching puzzles

    Proceedings of The International Symposium on Multiple-Valued Logic

2008

  1. Edge matching puzzles as hard SAT/CSP benchmarks

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. From high girth graphs to hard instances

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Generating Hard SAT/CSP Instances Using Expander Graphs

    Proceedings of the 23rd AAAI Conference on Artificial Intelligence, AAAI 2008