Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
type: Item
instance of: scholarly article
title: Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
zbMATH Open document ID: 1099.68104
author: Hans van Maaren
author: Linda van Norden
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2005-05-20T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 2170153
zbMATH Keywords: satisfiability
zbMATH Keywords: Horn
zbMATH Keywords: 3-SAT
zbMATH Keywords: density
describes a project that uses: UnitWalk
MaRDI profile type: Publication
full work available at URL: s10472-005-2369-1
OpenAlex ID: W2030150287
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
cites work: Maximum renamable Horn sub-CNFs
cites work: The complexity of theorem-proving procedures
cites work: Variable and term removal from Boolean formulae
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q4475625
cites work: Sharp thresholds of graph properties, and the $k$-sat problem
cites work: Some simplified NP-complete graph problems
cites work: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
cites work: Q4704799
cites work: Theory and Applications of Satisfiability Testing
cites work: Solving satisfiability problems using elliptic approximations. A note on volumes and weights
DOI: 10.1007/S10472-005-2369-1
description: scientific article; zbMATH DE number 2170153