Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/162425
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Bejar, Ramon | - |
dc.contributor.author | Manyà, Felip | - |
dc.contributor.author | Cabiscol, Alba | - |
dc.contributor.author | Fernández, César | - |
dc.contributor.author | Gomes, Carla | - |
dc.date.accessioned | 2018-03-19T11:36:18Z | - |
dc.date.available | 2018-03-19T11:36:18Z | - |
dc.date.issued | 2007 | - |
dc.identifier | doi: 10.1016/j.dam.2005.10.020 | - |
dc.identifier | issn: 0166-218X | - |
dc.identifier.citation | Discrete Applied Mathematics 155: 1613- 1626 (2007) | - |
dc.identifier.uri | http://hdl.handle.net/10261/162425 | - |
dc.description.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. © 2006 Elsevier B.V. All rights reserved. | - |
dc.description.sponsorship | Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia , by the DARPA contracts F30602-00-2-0530 and F30602-00-2-0596 and by the Intelligent Information Systems Institute, Cornell University, funded by AFRL/AFOSR (F49620-01-1). The second author is supported by a grant Ramón y Cajal . | - |
dc.publisher | Elsevier | - |
dc.rights | closedAccess | - |
dc.subject | Many-valued logic | - |
dc.subject | Solvers | - |
dc.subject | Satisfiability | - |
dc.subject | Combinatorial problem solving | - |
dc.title | Regular-SAT: A many-valued approach to solving combinatorial problems | - |
dc.type | artículo | - |
dc.identifier.doi | 10.1016/j.dam.2005.10.020 | - |
dc.date.updated | 2018-03-19T11:36:18Z | - |
dc.description.version | Peer Reviewed | - |
dc.language.rfc3066 | eng | - |
dc.contributor.funder | Ministerio de Educación y Ciencia (España) | - |
dc.contributor.funder | Cornell University | - |
dc.relation.csic | Sí | - |
dc.identifier.funder | http://dx.doi.org/10.13039/100007231 | es_ES |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | No Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | artículo | - |
Aparece en las colecciones: | (IIIA) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
7
checked on 24-may-2024
WEB OF SCIENCETM
Citations
7
checked on 27-feb-2024
Page view(s)
224
checked on 28-may-2024
Download(s)
73
checked on 28-may-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.