English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/130394
COMPARTIR / IMPACTO:
Estadísticas
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Título

SAT and SMT technology for many-valued logics

AutorAnsótegui, Carlos; Bofill, Miquel; Manyà, Felip ; Villaret, Mateu
Palabras claveBit vectors
Lukasiewicz infinitely-valued logic
SMT
SAT
Regular encodings
Many-valued logics
Linear integer arithmetic
Linear real arithmetic
Fecha de publicación2015
EditorOld City Publishing
CitaciónJournal of Multiple-Valued Logic and Soft Computing 24: 151- 172 (2015)
Resumen© 2014 Old City Publishing, Inc. We propose to use the SAT and SMT technology to deal with manyvalued logics. Our approach is twofold. Firstly, we focus on finitelyvalued logics, and extend the language of signed CNF formulas with linear integer arithmetic constraints. This way, we get a simple modeling language in which a wide range of practical combinatorial problems admit compact and natural encodings. We then define efficient translations from our language into the SAT and SMT formalisms, and propose to use SAT and SMT solvers for finding solutions. Secondly, we show how we can use the SMT technology to build efficient automated theorem provers for infinitely-valued logics, taking Lukasiewicz infinitely-valued logic as a case study.
URIhttp://hdl.handle.net/10261/130394
Identificadoresissn: 1542-3980
Aparece en las colecciones: (IIIA) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
accesoRestringido.pdf15,38 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.