Presentation 2004-06-21
Preprocessing Clause Sets by Abstract Model Generation
Mayumi UMEDA, Miyuki KOSHIMURA, Ryuzo HASEGAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Abstract model generation is model generation for abstract clause sets in which arguments of atoms are ignored. We give two abstract clause sets which are obtained from normal clause sets. One is for checking satisfiability of the original normal clause set. Another is used for eliminating unnecessary clauses from the original one. These abstract clause sets are propositional, i.e. decidable. Thus, we can use them for preprocessing the original one. We evaluate effects of proposed methods using problems from CASC-19.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Theorem proving / Clause abstraction / Clause preprocessing / Model generation
Paper # AI2004-7
Date of Issue

Conference Information
Committee AI
Conference Date 2004/6/14(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) Preprocessing Clause Sets by Abstract Model Generation
Sub Title (in English)
Keyword(1) Theorem proving
Keyword(2) Clause abstraction
Keyword(3) Clause preprocessing
Keyword(4) Model generation
1st Author's Name Mayumi UMEDA
1st Author's Affiliation Kyushu University()
2nd Author's Name Miyuki KOSHIMURA
2nd Author's Affiliation Kyushu University
3rd Author's Name Ryuzo HASEGAWA
3rd Author's Affiliation Kyushu University
Date 2004-06-21
Paper # AI2004-7
Volume (vol) vol.104
Number (no) 133
Page pp.pp.-
#Pages 6
Date of Issue