Partitioning methods for satisfiability testing on large formulas
type: Item
instance of: scholarly article
title: Partitioning methods for satisfiability testing on large formulas
zbMATH Open document ID: 1003.68148
author: Tai Joon Park
author: Allen Van Gelder
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 1853129
MaRDI profile type: Publication
full work available at URL: inco.1999.2860
OpenAlex ID: W1970590090
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Directed hypergraphs and applications
cites work: Algorithms for testing the satisfiability of propositional formulae
cites work: Partitioning methods for satisfiability testing on large formulas
cites work: Q5687274
DOI: 10.1006/INCO.1999.2860
description: scientific article; zbMATH DE number 1853129