Presentation	2002/5/17 Pruning Model Generation Tree by a Boolean Constraint Solver Miyuki KOSHIMURA, Ryuzo HASEGAWA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We present a simple method for eliminating redundant searches in model generation. The method employs Boolean Constraints which are conjunctions of ground instances of clauses having participated in proofs. Boolean Constraints work as sets of lemmas with which duplicate subproofs and irrelevant model extensions can be eliminated. The method has been tentatively implemented on a constraint logic programming system. We evaluated effects of the method by proving some typical problems.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Model Generation / Boolean Constraints Solver / Constraint Logic Programming System
Paper #	AI2002-6
Date of Issue

Conference Information
Committee	AI
Conference Date	2002/5/17(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Artificial Intelligence and Knowledge-Based Processing (AI)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Pruning Model Generation Tree by a Boolean Constraint Solver
Sub Title (in English)
Keyword(1)	Model Generation
Keyword(2)	Boolean Constraints Solver
Keyword(3)	Constraint Logic Programming System
1st Author's Name	Miyuki KOSHIMURA
1st Author's Affiliation	Graduate School of Information Science and Electrical Engineering, Kyushu University()
2nd Author's Name	Ryuzo HASEGAWA
2nd Author's Affiliation	Graduate School of Information Science and Electrical Engineering, Kyushu University
Date	2002/5/17
Paper #	AI2002-6
Volume (vol)	vol.102
Number (no)	91
Page	pp.pp.-
#Pages	6
Date of Issue