Abstract model generation for preprocessing clause sets

Miyuki Koshimura; Mayumi Umeda; Ryuzo Hasegawa

doi:10.1007/978-3-540-32275-7_5

Abstract model generation for preprocessing clause sets

Miyuki Koshimura, Mayumi Umeda, Ryuzo Hasegawa

知能科学

研究成果: Chapter in Book/Report/Conference proceeding › Conference contribution

抄録

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.

本文言語	英語
ホスト出版物のタイトル	Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings
出版社	Springer Verlag
ページ	67-78
ページ数	12
ISBN（印刷版）	3540252363, 9783540252368
DOI	https://doi.org/10.1007/978-3-540-32275-7_5
出版ステータス	出版済み - 2005
イベント	11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2004 - Montevideo, ウルグアイ継続期間: 3 14 2005 → 3 18 2005

出版物シリーズ

名前	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
巻	3452 LNAI
ISSN（印刷版）	0302-9743
ISSN（電子版）	1611-3349

その他

その他	11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2004
Country	ウルグアイ
City	Montevideo
Period	3/14/05 → 3/18/05

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

文献へのアクセス

10.1007/978-3-540-32275-7_5

フィンガープリント「Abstract model generation for preprocessing clause sets」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル

Koshimura, M., Umeda, M., & Hasegawa, R. (2005). Abstract model generation for preprocessing clause sets. In Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings (pp. 67-78). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3452 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-540-32275-7_5

Abstract model generation for preprocessing clause sets. / Koshimura, Miyuki; Umeda, Mayumi; Hasegawa, Ryuzo.

Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings. Springer Verlag, 2005. p. 67-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3452 LNAI).

研究成果: Chapter in Book/Report/Conference proceeding › Conference contribution

Koshimura, M, Umeda, M & Hasegawa, R 2005, Abstract model generation for preprocessing clause sets. in Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3452 LNAI, Springer Verlag, pp. 67-78, 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2004, Montevideo, ウルグアイ, 3/14/05. https://doi.org/10.1007/978-3-540-32275-7_5

Koshimura M, Umeda M, Hasegawa R. Abstract model generation for preprocessing clause sets. In Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings. Springer Verlag. 2005. p. 67-78. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-32275-7_5

Koshimura, Miyuki ; Umeda, Mayumi ; Hasegawa, Ryuzo. / Abstract model generation for preprocessing clause sets. Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings. Springer Verlag, 2005. pp. 67-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b70f082638604461a828ba2f878e93f9,

title = "Abstract model generation for preprocessing clause sets",

abstract = "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.",

author = "Miyuki Koshimura and Mayumi Umeda and Ryuzo Hasegawa",

year = "2005",

doi = "10.1007/978-3-540-32275-7_5",

language = "English",

isbn = "3540252363",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "67--78",

booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 11th International Conference, LPAR 2004, Proceedings",

address = "Germany",

note = "11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2004 ; Conference date: 14-03-2005 Through 18-03-2005",

}

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 -