2007•Unpublished venueRequires access

Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings

Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter W. Nightingale

Open publisher page 5 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Boolean satisfiability problem, Maximum satisfiability problem, True quantified Boolean formula, Mathematics, Boolean data type, Boolean expression, Domain (mathematical analysis), Solver

Back to paper search Browse research topics Original source

Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings — Research Paper | ScholarLens