Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10190142" target="_blank" >RIV/00216208:11320/14:10190142 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1142/S0218213013500292" target="_blank" >http://dx.doi.org/10.1142/S0218213013500292</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218213013500292" target="_blank" >10.1142/S0218213013500292</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup

Popis výsledku v původním jazyce

A new type of partially global consistency derived from 2, -consistency called bounded 2, - consistency (B2C-consistency) is presented in this paper. It is designed for application in propositional satisfiability (SAT) as a building block for a preprocessing tool. Together with the new B2C-consistency a special mechanism for selecting regions of the input SAT instance with difficult constraint setup was also proposed. This mechanism is used to select suitable difficult sub-problems whose simplificationthrough consistency can lead to a significant reduction in the effort needed to solve the instance. A new prototype preprocessing tool preprocessSIGMA which is based on the proposed techniques was implemented. As a proof of new concepts a competitive experimental evaluation on a set of relatively difficult SAT instances was conducted. It showed that our prototype preprocessor is competitive with respect to the existent preprocessing tools LiVer, NiVer, HyPre, blocked clause elimination (

Název v anglickém jazyce

Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup

Popis výsledku anglicky

A new type of partially global consistency derived from 2, -consistency called bounded 2, - consistency (B2C-consistency) is presented in this paper. It is designed for application in propositional satisfiability (SAT) as a building block for a preprocessing tool. Together with the new B2C-consistency a special mechanism for selecting regions of the input SAT instance with difficult constraint setup was also proposed. This mechanism is used to select suitable difficult sub-problems whose simplificationthrough consistency can lead to a significant reduction in the effort needed to solve the instance. A new prototype preprocessing tool preprocessSIGMA which is based on the proposed techniques was implemented. As a proof of new concepts a competitive experimental evaluation on a set of relatively difficult SAT instances was conducted. It showed that our prototype preprocessor is competitive with respect to the existent preprocessing tools LiVer, NiVer, HyPre, blocked clause elimination (

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Propojení plánování a provádění plánů</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal on Artificial Intelligence Tools

ISSN

0218-2130

e-ISSN

—

Svazek periodika

23

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

29

Strana od-do

1-29

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—