TY - GEN
T1 - Abstract model generation for preprocessing clause sets
AU - Koshimura, Miyuki
AU - Umeda, Mayumi
AU - Hasegawa, Ryuzo
PY - 2005
Y1 - 2005
N2 - Abstract model generation refers to 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.
AB - Abstract model generation refers to 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.
UR - http://www.scopus.com/inward/record.url?scp=26844498430&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=26844498430&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-32275-7_5
DO - 10.1007/978-3-540-32275-7_5
M3 - Conference contribution
AN - SCOPUS:26844498430
SN - 3540252363
SN - 9783540252368
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 67
EP - 78
BT - Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings
PB - Springer Verlag
T2 - 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2004
Y2 - 14 March 2005 through 18 March 2005
ER -