Tools for modeling and solving search problems

Deborah East; Mikhail Iakhiaev; Artur Mikitiuk; Mirosław Truszczyński

Tools for modeling and solving search problems

Deborah East, Mikhail Iakhiaev, Artur Mikitiuk, Mirosław Truszczyński

Computer Science

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

8 Scopus citations

Abstract

In this paper, we describe a language PS^pb to model search problems that are specified in terms of boolean combinations of pseudo-boolean constraints. We then describe software tools that allow one to use SAT and SAT(PB) solvers to compute solutions to instances of search problems represented in the language PS^pb.

Original language	English
Pages (from-to)	301-312
Number of pages	12
Journal	AI Communications
Volume	19
Issue number	4
State	Published - 2006

Keywords

Grounder
Pseudo-boolean constraints
SAT

ASJC Scopus subject areas

Artificial Intelligence

Cite this

@article{542314e8a80040879fa505012bcbd5dc,

title = "Tools for modeling and solving search problems",

abstract = "In this paper, we describe a language PSpb to model search problems that are specified in terms of boolean combinations of pseudo-boolean constraints. We then describe software tools that allow one to use SAT and SAT(PB) solvers to compute solutions to instances of search problems represented in the language PSpb.",

keywords = "Grounder, Pseudo-boolean constraints, SAT",

author = "Deborah East and Mikhail Iakhiaev and Artur Mikitiuk and Miros{\l}aw Truszczy{\'n}ski",

year = "2006",

language = "English",

volume = "19",

pages = "301--312",

number = "4",

}

TY - JOUR

T1 - Tools for modeling and solving search problems

AU - East, Deborah

AU - Iakhiaev, Mikhail

AU - Mikitiuk, Artur

AU - Truszczyński, Mirosław

PY - 2006

Y1 - 2006

N2 - In this paper, we describe a language PSpb to model search problems that are specified in terms of boolean combinations of pseudo-boolean constraints. We then describe software tools that allow one to use SAT and SAT(PB) solvers to compute solutions to instances of search problems represented in the language PSpb.

AB - In this paper, we describe a language PSpb to model search problems that are specified in terms of boolean combinations of pseudo-boolean constraints. We then describe software tools that allow one to use SAT and SAT(PB) solvers to compute solutions to instances of search problems represented in the language PSpb.

KW - Grounder

KW - Pseudo-boolean constraints

KW - SAT

UR - http://www.scopus.com/inward/record.url?scp=33845224299&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845224299&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33845224299

SN - 0921-7126

VL - 19

SP - 301

EP - 312

JO - AI Communications

JF - AI Communications

IS - 4

ER -

Tools for modeling and solving search problems

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this