The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Felip Manyà: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández, Felip Manyà
    Modeling Choices in Quasigroup Completion: SAT vs. CSP. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:137-142 [Conf]
  2. Ramón Béjar, Felip Manyà
    Solving the Round Robin Problem Using Propositional Logic. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:262-266 [Conf]
  3. Chu-Min Li, Felip Manyà, Jordi Planes
    Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  4. Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Felip Manyà
    A Multi-agent system architecture for monitoring medical protocols. [Citation Graph (0, 0)][DBLP]
    Agents, 2000, pp:499-505 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    CCIA, 2002, pp:139-144 [Conf]
  6. Carlos Ansótegui, Jose Larrubia, Felip Manyà
    Boosting Chaff's Performance by Incorporating CSP Heuristics. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:96-107 [Conf]
  7. Carlos Ansótegui, Felip Manyà
    Bridging the Gap between SAT and CSP. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:784-785 [Conf]
  8. Josep Argelich, Felip Manyà
    Solving Over-Constrained Problems with SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:838- [Conf]
  9. Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes
    Capturing Structure with Satisfiability. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:137-152 [Conf]
  10. Chu Li, Felip Manyà, Jordi Planes
    Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:403-414 [Conf]
  11. Ramón Béjar, Felip Manyà
    A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. [Citation Graph (0, 0)][DBLP]
    ESCQARU, 1999, pp:22-31 [Conf]
  12. Teresa Alsinet, Felip Manyà, Jordi Planes
    A Max-SAT Solver with Lazy Data Structures. [Citation Graph (0, 0)][DBLP]
    IBERAMIA, 2004, pp:334-342 [Conf]
  13. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    The Logic Behind Weighted CSP. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:32-37 [Conf]
  14. Gonzalo Escalada-Imaz, Felip Manyà
    Efficient Interpretation of Propositional Multiple-valued Logic Programs. [Citation Graph (0, 0)][DBLP]
    IPMU, 1994, pp:428-439 [Conf]
  15. Ramón Béjar, Felip Manyà
    Phase Transitions in the Regular Random 3-SAT Problem. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1999, pp:292-300 [Conf]
  16. Bernhard Beckert, Reiner Hähnle, Felip Manyà
    The 2-SAT Problem of Regular Signed CNF Formulas. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2000, pp:331-336 [Conf]
  17. Bernhard Beckert, Reiner Hähnle, Felip Manyà
    Transformations between Signed and Classical Clause Logic. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1999, pp:248-255 [Conf]
  18. Ramón Béjar, Reiner Hähnle, Felip Manyà
    A Modular Reduction of Regular Logic to Classical Logic. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2001, pp:221-226 [Conf]
  19. Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà
    The Interface between P and NP in Signed CNF Formulas. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2004, pp:251-256 [Conf]
  20. Carlos Ansótegui, Felip Manyà
    New Logical and Complexity Results for Signed-SAT. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2003, pp:181-187 [Conf]
  21. Carlos Ansótegui, Felip Manyà
    Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2005, pp:290-295 [Conf]
  22. Josep Argelich, Xavier Domingo, Chu-Min Li, Felip Manyà, Jordi Planes
    Towards Solving Many-Valued MaxSAT. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2006, pp:26- [Conf]
  23. Gonzalo Escalada-Imaz, Felip Manyà
    The Satisfiability Problem in Multiple-Valued Horn Formulae. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1994, pp:250-256 [Conf]
  24. Ramón Béjar, Felip Manyà
    Solving Combinatorial Problems with Regular Local Search Algorithms. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:33-43 [Conf]
  25. Teresa Alsinet, Felip Manyà, Jordi Planes
    Improved Exact Solvers for Weighted Max-SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:371-377 [Conf]
  26. Carlos Ansótegui, Felip Manyà
    Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  27. Carlos Ansótegui, Felip Manyà
    Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:1-15 [Conf]
  28. Josep Argelich, Felip Manyà
    Solving Over-Constrained Problems with SAT Technology. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:1-15 [Conf]
  29. Maria Luisa Bonet, Jordi Levy, Felip Manyà
    A Complete Calculus for Max-SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:240-251 [Conf]
  30. Carlos Ansótegui, Felip Manyà
    Una introducción a los algoritmos de satisfactibilidad. [Citation Graph (0, 0)][DBLP]
    Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003, v:20, n:, pp:43-56 [Journal]
  31. Felip Manyà, Carla P. Gomes
    Técnicas de resolución de problemas de satisfacción de restricciones. [Citation Graph (0, 0)][DBLP]
    Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003, v:19, n:, pp:169-180 [Journal]
  32. 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. [Citation Graph (0, 0)][DBLP]
    Artificial Intelligence in Medicine, 2003, v:27, n:3, pp:367-392 [Journal]
  33. Hantao Zhang, Haiou Shen, Felip Manyà
    Exact Algorithms for MAX-SAT. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:1, pp:- [Journal]
  34. Josep Argelich, Felip Manyà
    Exact Max-SAT solvers for over-constrained problems. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2006, v:12, n:4-5, pp:375-392 [Journal]
  35. Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz
    The satisfiability problem in regular CNF-formulas. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 1998, v:2, n:3, pp:116-123 [Journal]
  36. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Inference Rules for High-Order Consistency in Weighted CSP. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:167-172 [Conf]
  37. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Mapping CSP into Many-Valued SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:10-15 [Conf]
  38. Josep Argelich, Felip Manyà
    Partial Max-SAT Solvers with Clause Learning. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:28-40 [Conf]
  39. Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Resolution for Max-SAT. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:8-9, pp:606-618 [Journal]
  40. Carlos Ansótegui, Jose Larrubia, Chu-Min Li, Felip Manyà
    Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2007, v:49, n:1-4, pp:191-205 [Journal]
  41. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1613-1626 [Journal]

  42. Measuring the Hardness of SAT Instances. [Citation Graph (, )][DBLP]


  43. What Is a Real-World SAT Instance? [Citation Graph (, )][DBLP]


  44. Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. [Citation Graph (, )][DBLP]


  45. A Complete Resolution Calculus for Signed Max-SAT. [Citation Graph (, )][DBLP]


  46. Encoding Max-CSP into Partial Max-SAT. [Citation Graph (, )][DBLP]


  47. Regular Encodings from Max-CSP into Partial Max-SAT. [Citation Graph (, )][DBLP]


  48. Generating Hard Instances for MaxSAT. [Citation Graph (, )][DBLP]


  49. New Insights into Encodings from MaxCSP into Partial MaxSAT. [Citation Graph (, )][DBLP]


  50. Sequential Encodings from Max-CSP into Partial Max-SAT. [Citation Graph (, )][DBLP]


  51. Modelling Max-CSP as Partial Max-SAT. [Citation Graph (, )][DBLP]


  52. A Preprocessor for Max-SAT Solvers. [Citation Graph (, )][DBLP]


  53. Exploiting Cycle Structures in Max-SAT. [Citation Graph (, )][DBLP]


  54. Exact MinSAT Solving. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002