Universitat de Lleida
    • English
    • català
    • español
  • English 
    • English
    • català
    • español
  • Login
Repositori Obert UdL
View Item 
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Regular-SAT: A many-valued approach to solving combinatorial problems

Thumbnail
View/Open
011049.pdf (411.3Kb)
Sol·licita una còpia
Issue date
2007
Author
Béjar Torres, Ramón
Manyà Serres, Felip
Cabiscol i Teixidó, Alba
Fernàndez Camon, César
Gomes, Carla
Suggested citation
Béjar Torres, Ramón; Manyà Serres, Felip; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Gomes, Carla; . (2007) . Regular-SAT: A many-valued approach to solving combinatorial problems. Discrete Applied Mathematics, 2007, vol. 155, núm. 12, p. 1613-1626. https://doi.org/10.1016/j.dam.2005.10.020.
Impact


Web of Science logo    citations in Web of Science

Scopus logo    citations in Scopus

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
Abstract
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 allows us to define a uniform encoding formalism, to extend existing SAT algorithms to Regular-SAT without incurring excessive overhead in terms of computational cost, and to identify phase transition phenomena in randomly generated instances. On the other hand, Regular-SAT inherits from CSP more compact and natural encodings that maintain more the structure of the original problem. Our experimental results—using a range of benchmark problems—provide evidence that Regular-SAT offers practical computational advantages for solving combinatorial problems.
URI
http://hdl.handle.net/10459.1/57349
DOI
https://doi.org/10.1016/j.dam.2005.10.020
Is part of
Discrete Applied Mathematics, 2007, vol. 155, núm. 12, p. 1613-1626
European research projects
Collections
  • Articles publicats (Informàtica i Enginyeria Industrial) [932]
  • Publicacions de projectes de recerca del Plan Nacional [2624]
  • Grup de Recerca en Energia i Intel·ligència Artificial (GREiA) (INSPIRES) [443]

Contact Us | Send Feedback | Legal Notice
© 2022 BiD. Universitat de Lleida
Metadata subjected to 
 

 

Browse

All of the repositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

Statistics

View Usage Statistics

D'interès

Política institucional d'accés obertDiposita les teves publicacionsDiposita dades de recercaSuport a la recerca

Contact Us | Send Feedback | Legal Notice
© 2022 BiD. Universitat de Lleida
Metadata subjected to