The Incremental Satisfiability Problem for a Two Conjunctive Normal Form

Please use this identifier to cite or link to this item: http://ri.uaemex.mx/handle20.500.11799/67669

Title:	The Incremental Satisfiability Problem for a Two Conjunctive Normal Form
Authors:	GUILLERMO DE ITA LUNA JOSE RAYMUNDO MARCIAL ROMERO JOSE ANTONIO HERNANDEZ SERVIN
Keywords:	satisfiability problem;incremental satisfiability problem;2-sat;entail propositional problem;info:eu-repo/classification/cti/7
Publisher:	ELSEVIER
Project:	328;
Description:	We 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.
Other Identifiers:	http://hdl.handle.net/20.500.11799/67669
Rights:	info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0
Appears in Collections:	Producción

Check

DSpace CRIS