1. DSpace-CRIS UAEMEX
  2. Interoperabilidad Repositorio Nacional
  3. Producción
Please use this identifier to cite or link to this item: http://ri.uaemex.mx/handle20.500.11799/67669
DC FieldValueLanguage
dc.contributor.authorGUILLERMO DE ITA LUNAen_EU
dc.contributor.authorJOSE RAYMUNDO MARCIAL ROMEROen_EU
dc.contributor.authorJOSE ANTONIO HERNANDEZ SERVINen_EU
dc.creatorGUILLERMO DE ITA LUNA-
dc.creatorJOSE RAYMUNDO MARCIAL ROMERO-
dc.creatorJOSE ANTONIO HERNANDEZ SERVIN-
dc.date2016-01-01-
dc.identifierhttp://hdl.handle.net/20.500.11799/67669-
dc.descriptionWe propose a novel method to review K ⊢ φ when K and φ are both in Conjunctive Normal Forms (CF). We extend our method to solve the incremental satisfiablity problem (ISAT), and we present different cases where ISAT can be solved in polynomial time. Especially, we present an algorithm for 2-ISAT. Our last algorithm allow us to establish an upper bound for the time-complexity of 2-ISAT, as well as to establish some tractable cases for the 2-ISAT problem.-
dc.languageeng-
dc.publisherELSEVIER-
dc.relation328;-
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0-
dc.source1571-0661-
dc.subjectsatisfiability problem-
dc.subjectincremental satisfiability problem-
dc.subject2-sat-
dc.subjectentail propositional problem-
dc.subjectinfo:eu-repo/classification/cti/7-
dc.titleThe Incremental Satisfiability Problem for a Two Conjunctive Normal Form-
dc.typearticle-
dc.audiencestudents-
dc.audienceresearchers-
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:Producción
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.