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

Saved in:
Bibliographic Details
Published inJournal of computer science and technology Vol. 27; no. 1; pp. 37 - 41
Main Author 金继伟 马菲菲 张健
Format Journal Article
LanguageEnglish
Published Boston Springer US 2012
Springer Nature B.V
Subjects
Analysis
Artificial Intelligence
Computer Science
CSP
Data Structures and Information Theory
Experiments
Heuristic
Information Systems Applications (incl.Internet)
Mathematical analysis
Mathematical models
Order disorder
Performance enhancement
Semantics
Short Paper
Software Engineering
Solvers
Studies
Theory of Computation
Variables
全称量词
变量排序
存在量词
改善性能
标准
约束满足问题
集成
standard dependency scheme
quantified constraint satisfaction problem
variable ordering heuristics
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:quantified constraint satisfaction problem, standard dependency scheme, variable ordering heuristics
Ji-Wei Jin, Fei-Fei Ma, Jian Zhang（State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China）
11-2296/TP
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.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-012-1204-5