A simple test improves checking satisfiability

Eliezer L. Lozinskii

doi:10.1016/0743-1066(93)90015-9

A simple test improves checking satisfiability

Eliezer L. Lozinskii

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

In many practical cases satisfiability of a set of clauses can be decided before an interpretation is found that satisfies all clauses of the set. We present a test for such an early discovery of satisfiability, EDS, and develop an algorithm, IDP, incorporating EDS and a branching heuristics related to this test. IDP was implemented and tested on a wide variety of instances and showed a high performance and stability with respect to changing the proportion of non-Horn clauses.

Original language	English
Pages (from-to)	99-111
Number of pages	13
Journal	Journal of Logical and Algebraic Methods in Programming
Volume	15
Issue number	1-2
DOIs	https://doi.org/10.1016/0743-1066(93)90015-9
State	Published - Jan 1993

Access to Document

10.1016/0743-1066(93)90015-9

Cite this

@article{8e0be9211ab845b296517cc2b3e8536b,

title = "A simple test improves checking satisfiability",

abstract = "In many practical cases satisfiability of a set of clauses can be decided before an interpretation is found that satisfies all clauses of the set. We present a test for such an early discovery of satisfiability, EDS, and develop an algorithm, IDP, incorporating EDS and a branching heuristics related to this test. IDP was implemented and tested on a wide variety of instances and showed a high performance and stability with respect to changing the proportion of non-Horn clauses.",

author = "Lozinskii, \{Eliezer L.\}",

year = "1993",

month = jan,

doi = "10.1016/0743-1066(93)90015-9",

language = "אנגלית",

volume = "15",

pages = "99--111",

journal = "Journal of Logical and Algebraic Methods in Programming",

issn = "0743-1066",

publisher = "Elsevier Inc.",

number = "1-2",

}

TY - JOUR

T1 - A simple test improves checking satisfiability

AU - Lozinskii, Eliezer L.

PY - 1993/1

Y1 - 1993/1

N2 - In many practical cases satisfiability of a set of clauses can be decided before an interpretation is found that satisfies all clauses of the set. We present a test for such an early discovery of satisfiability, EDS, and develop an algorithm, IDP, incorporating EDS and a branching heuristics related to this test. IDP was implemented and tested on a wide variety of instances and showed a high performance and stability with respect to changing the proportion of non-Horn clauses.

AB - In many practical cases satisfiability of a set of clauses can be decided before an interpretation is found that satisfies all clauses of the set. We present a test for such an early discovery of satisfiability, EDS, and develop an algorithm, IDP, incorporating EDS and a branching heuristics related to this test. IDP was implemented and tested on a wide variety of instances and showed a high performance and stability with respect to changing the proportion of non-Horn clauses.

UR - https://www.scopus.com/pages/publications/0442277250

U2 - 10.1016/0743-1066(93)90015-9

DO - 10.1016/0743-1066(93)90015-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0442277250

SN - 0743-1066

VL - 15

SP - 99

EP - 111

JO - Journal of Logical and Algebraic Methods in Programming

JF - Journal of Logical and Algebraic Methods in Programming

IS - 1-2

ER -

A simple test improves checking satisfiability

Abstract

Access to Document

Other files and links

Fingerprint

Cite this