finding orthogonal arrays using satisfiability checkers and symmetry     breaking constraints

	finding orthogonal arrays using satisfiability checkers and symmetry breaking constraints
	Ma Feifei ; Zhang Jian
	2008
会议名称	10th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2008)
会议日期	DEC 15-19,
会议地点	Hanoi, VIETNAM
关键词	Artificial intelligence Bionics Computer software selection and evaluation Set theory Software testing
页码	247-259
英文摘要	Orthogonal arrays are very important combinatorial objects which call be used in software testing and other areas. Mathematical methods for constructing such arrays have been studied extensively in the past decades. In contrast, computer searc
会议主办者	Vietnamese Acad Sci & Technol, Minist Sci & Technol Vietnam, Hanoi Univ Technol, Vietnam Natl UnivAir Force Off Sci Res, Asian Off Aerosp Res & Dev
会议录	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议录出版者	PRICAI 2008: TRENDS IN ARTIFICIAL INTELLIGENCE
会议录出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN号	0302-9743
ISBN号	978-3-540-89196-3
内容类型	会议论文
源URL	[http://124.16.136.157/handle/311060/10668]
专题	软件研究所_计算机科学国家重点实验室 _会议论文
推荐引用方式 GB/T 7714	Ma Feifei,Zhang Jian. finding orthogonal arrays using satisfiability checkers and symmetry breaking constraints[C]. 见:10th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2008). Hanoi, VIETNAM. DEC 15-19,.