schliessen

Filtern

 

Bibliotheken

Integrating Standard Dependency Schemes in QCSP Solvers

Quantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers. In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers. The technique ca... Full description

Journal Title: Journal of Computer Science and Technology 2012, Vol.27(1), pp.37-41
Main Author: Jin, Ji-Wei
Other Authors: Ma, Fei-Fei , Zhang, Jian
Format: Electronic Article Electronic Article
Language: English
Subjects:
ID: ISSN: 1000-9000 ; E-ISSN: 1860-4749 ; DOI: 10.1007/s11390-012-1204-5
Link: http://dx.doi.org/10.1007/s11390-012-1204-5
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: springer_jour10.1007/s11390-012-1204-5
title: Integrating Standard Dependency Schemes in QCSP Solvers
format: Article
creator:
  • Jin, Ji-Wei
  • Ma, Fei-Fei
  • Zhang, Jian
subjects:
  • quantified constraint satisfaction problem
  • standard dependency scheme
  • variable ordering heuristics
ispartof: Journal of Computer Science and Technology, 2012, Vol.27(1), pp.37-41
description: Quantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers. In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers. The technique can help to decide the next variable to be assigned in QCSP solving. We also introduce a new factor into the variable ordering heuristics: a variable’s dep is the number of variables depending on it. This factor represents the probability of getting more candidates for the next variable to be assigned. Experimental results show that variable ordering heuristics with standard dependency schemes and the new factor dep can improve the performance of QCSP solvers.
language: eng
source:
identifier: ISSN: 1000-9000 ; E-ISSN: 1860-4749 ; DOI: 10.1007/s11390-012-1204-5
fulltext: fulltext
issn:
  • 1860-4749
  • 18604749
  • 1000-9000
  • 10009000
url: Link


@attributes
ID1250985985
RANK0.07
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
LOCALfalse
PrimoNMBib
record
control
sourcerecordid10.1007/s11390-012-1204-5
sourceidspringer_jour
recordidTN_springer_jour10.1007/s11390-012-1204-5
sourcesystemPC
pqid1019635305
galeid276723361
display
typearticle
titleIntegrating Standard Dependency Schemes in QCSP Solvers
creatorJin, Ji-Wei ; Ma, Fei-Fei ; Zhang, Jian
ispartofJournal of Computer Science and Technology, 2012, Vol.27(1), pp.37-41
identifier
subjectquantified constraint satisfaction problem ; standard dependency scheme ; variable ordering heuristics
descriptionQuantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers. In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers. The technique can help to decide the next variable to be assigned in QCSP solving. We also introduce a new factor into the variable ordering heuristics: a variable’s dep is the number of variables depending on it. This factor represents the probability of getting more candidates for the next variable to be assigned. Experimental results show that variable ordering heuristics with standard dependency schemes and the new factor dep can improve the performance of QCSP solvers.
languageeng
source
version6
lds50peer_reviewed
links
openurl$$Topenurl_article
openurlfulltext$$Topenurlfull_article
backlink$$Uhttp://dx.doi.org/10.1007/s11390-012-1204-5$$EView_full_text_in_Springer_(Subscribers_only)
search
creatorcontrib
0Jin, Ji-Wei
1Ma, Fei-Fei
2Zhang, Jian
titleIntegrating Standard Dependency Schemes in QCSP Solvers
descriptionQuantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers. In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers. The technique can help to decide the next variable to be assigned in QCSP solving. We also introduce a new factor into the variable ordering heuristics: a variable’s dep is the number of variables depending on it. This factor represents the probability of getting more candidates for the next variable to be assigned. Experimental results show that variable ordering heuristics with standard dependency schemes and the new factor dep can improve the performance of QCSP solvers.
subject
0quantified constraint satisfaction problem
1standard dependency scheme
2variable ordering heuristics
general
010.1007/s11390-012-1204-5
1English
2Springer Science & Business Media B.V.
3SpringerLink
sourceidspringer_jour
recordidspringer_jour10.1007/s11390-012-1204-5
issn
01860-4749
118604749
21000-9000
310009000
rsrctypearticle
creationdate2012
addtitle
0Journal of Computer Science and Technology
1J. Comput. Sci. Technol.
searchscopespringer_journals_complete
scopespringer_journals_complete
lsr30VSR-Enriched:[pages, galeid, pqid]
sort
titleIntegrating Standard Dependency Schemes in QCSP Solvers
authorJin, Ji-Wei ; Ma, Fei-Fei ; Zhang, Jian
creationdate20120100
facets
frbrgroupid9130589846492283396
frbrtype5
languageeng
creationdate2012
topic
0Quantified Constraint Satisfaction Problem
1Standard Dependency Scheme
2Variable Ordering Heuristics
collectionSpringerLink
prefilterarticles
rsrctypearticles
creatorcontrib
0Jin, Ji-Wei
1Ma, Fei-Fei
2Zhang, Jian
jtitleJournal Of Computer Science And Technology
toplevelpeer_reviewed
delivery
delcategoryRemote Search Resource
fulltextfulltext
addata
aulast
0Jin
1Ma
2Zhang
aufirst
0Ji-Wei
1Fei-Fei
2Jian
au
0Jin, Ji-Wei
1Ma, Fei-Fei
2Zhang, Jian
atitleIntegrating Standard Dependency Schemes in QCSP Solvers
jtitleJournal of Computer Science and Technology
stitleJ. Comput. Sci. Technol.
risdate201201
volume27
issue1
spage37
epage41
issn1000-9000
eissn1860-4749
genrearticle
ristypeJOUR
abstractQuantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers. In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers. The technique can help to decide the next variable to be assigned in QCSP solving. We also introduce a new factor into the variable ordering heuristics: a variable’s dep is the number of variables depending on it. This factor represents the probability of getting more candidates for the next variable to be assigned. Experimental results show that variable ordering heuristics with standard dependency schemes and the new factor dep can improve the performance of QCSP solvers.
copBoston
pubSpringer US
doi10.1007/s11390-012-1204-5
pages37-41
date2012-01