Translating Pseudo-Boolean Constraints into SAT

Een, Niklas; Sörensson, Niklas

doi:10.3233/SAT190014

Record: found
Abstract: found
Article: found

Is Open Access

Translating Pseudo-Boolean Constraints into SAT

Author(s): Niklas Eén ¹ , Niklas Sörensson ²

Editor(s): Daniel Le Berre , Laurent Simon

Publication date Created: March 01 2006

Publication date (Electronic): March 01 2006

Journal: Journal on Satisfiability, Boolean Modeling and Computation

Publisher: IOS Press

Read this article at

ScienceOpen Publisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: Journal on Satisfiability, Boolean Modeling and Computation

Abbreviated Title: SAT

Publisher: IOS Press

ISSN (Electronic): 15740617

Publication date Created: March 01 2006

Publication date (Electronic): March 01 2006

Volume: 2

Issue: 1-4

Pages: 1-26

Affiliations

[1 ]Cadence Berkeley Labs, Berkeley, USA. E-mail: niklas@cadence.com

[2 ]Chalmers University of Technology, Göteborg, Sweden. E-mail: nik@cs.chalmers.se

Article

DOI: 10.3233/SAT190014

SO-VID: 2effd1c9-bc68-41d4-815e-a10f2a99fa3c

License:

https://creativecommons.org/licenses/by-nc/4.0/

History

Data availability:

Translating Pseudo-Boolean Constraints into SAT

Read this article at

Related collections

ScienceOpen Research

Author and article information

Journal

Affiliations

Article

History

Comments

Comment on this article

Similar content 3,819

Cited by 18