English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/159316
Share/Impact:
Statistics
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:

Title

Finding Hard Instances of Satisfiability in Lukasiewicz Logics

AuthorsBofill, Miquel; Manyà, Felip ; Vidal, Amanda; Villaret, Mateu
KeywordsBecnhmarks
Complexity
Easy-hard-easy pattern
Satisfiability
Phase transition
Lukasiewicz logics
Issue Date18-May-2015
PublisherInstitute of Electrical and Electronics Engineers. Computer Group
CitationProceedings of the 5th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2015: 30-35
AbstractOne aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Lukasiewicz L-clausal forms, motivate their usefulness, study their complexity, and report on an empirical investigation that shows an easy-hard-easy pattern and a phase transition phenomenon when testing the satisfiability of L-clausal forms. © 2015 IEEE.
URIhttp://hdl.handle.net/10261/159316
Identifiersisbn: 978-147991777-8
issn: 0195623X
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
ISMVL2015_30-35.null191,17 kBUnknownView/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.