Some computational aspects of DISTANCE SAT
type: Item
instance of: scholarly article
title: Some computational aspects of DISTANCE SAT
zbMATH Open document ID: 1113.68096
author: Olivier Bailleux
author: Pierre Marquis
published in: Journal of Automated Reasoning
publication date: 2007-05-03T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B05
zbMATH DE Number: 5149178
zbMATH Keywords: propositional formula
describes a project that uses: BerkMin
describes a project that uses: Jerusat
MaRDI profile type: Publication
full work available at URL: s10817-006-9063-9
OpenAlex ID: W2062059592
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: Q4942636
cites work: Q4012216
cites work: Many hard examples for resolution
cites work: Decomposable negation normal form
cites work: A machine program for theorem-proving
cites work: A logical approach to interpolation based on similarity relations
cites work: Theory and Applications of Satisfiability Testing
cites work: Q5750466
cites work: Q4198056
cites work: BerkMin: A fast and robust SAT-solver
cites work: Q4787406
cites work: Reducing belief revision to circumscription (and vice versa)
cites work: Q4449294
cites work: Consequence finding algorithms
cites work: A theory of diagnosis from first principles
cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
cites work: A linear-time transformation of linear inequalities into conjunctive normal form
DOI: 10.1007/S10817-006-9063-9
description: scientific article; zbMATH DE number 5149178