Now showing items 1-7 of 7

    • Capturing Structure with Satisfiability 

      Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip; Gomes, Carla (Springer Verlag, 2001)
      We present Regular-SAT, an extension of Boolean Satisfiability basedon a class of many-valuedCNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT ...
    • Extending the Reach of SAT with Many-Valued Logics 

      Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip; Gomes, Carla (Elsevier, 2001)
      We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNFform ulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT ...
    • Minimal and Redundant SAT Encodings for the All-Interval-Series Problem 

      Alsinet, Teresa; Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip (Springer Verlag, 2002)
      The SAT encodings defined so far for the all-interval-series (ais) problem are very hard for local search but rather easy for systematic algorithms. We define different SAT encodings for the ais problem and provide ...
    • Modelling Max-CSP as Partial Max-SAT 

      Argelich Romà, Josep; Cabiscol i Teixidó, Alba; Lynce, Inês; Manyà Serres, Felip (Springer Verlag, 2008)
      We define a number of original encodings that map MaxCSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental ...
    • Obtención de Modelos 3D a partir de Proyecciones Axonométricas 

      Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; López, M.; Manyà Serres, Felip (2002)
      En este artículo presentamos un método computacional para la resolución del problema de la interpretación de una escena 3D a partir de una proyección axonométrica de la misma. Si bien este problema había sido tratado ...
    • Regular-SAT: A many-valued approach to solving combinatorial problems 

      Béjar Torres, Ramón; Manyà Serres, Felip; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Gomes, Carla (Elsevier, 2007)
      Regular-SAT is a constraint programming language between CSP and SAT that—by combining many of the good properties of each paradigm—offers a good compromise between performance and expressive power. Its similarity to SAT ...
    • Resolución de Problemas en Ingeniería Utilizando Técnicas de Inteligencia Artificial 

      Ansótegui Gil, Carlos José; Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Manyà Serres, Felip (AEIM, 2002)
      En este artículo presentamos el temario para una asignatura sobre resolución de problemas en ingeniería utilizando técnicas de inteligencia artificial. Por un lado, el temario cubre diferentes métodos automáticos (algoritmos) ...