60 Citations (Scopus)

Abstract

Transformation rules constitute a substantial part of the splitting method for handling the SAT problem. This article presents a new transformation rule and two algorithms using such a rule. It is proven that the algorithms have worst-case upper bounds.

Original languageEnglish
Pages (from-to)397-420
Number of pages24
JournalJournal of Automated Reasoning
Volume24
Issue number4
DOIs
Publication statusPublished - 1 Jan 2000

Scopus subject areas

  • Software
  • Computational Theory and Mathematics
  • Artificial Intelligence

Cite this