Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning

Yutaka Matsuo, Mitsuru Ishizuka

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

This paper describes two ways to transform propositional clauses into mathematical constraints, and gives an overview of mathematical optimization approaches to inference. The first transformation, which translates constraints into linear inequalities, has been applied to cost-based abduction in the past and showed good performance. The second one, which produces nonlinear equalities, is commonly used in other representations, such as SAT. We clarify their differences and advantages, and show the radical performance transition of linear inequalities. We are mainly targeting at cost-based hypothetical reasoning (or abduction), but through preprocessing, the discussion has generality.

本文言語English
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版社Springer Verlag
ページ118-127
ページ数10
2417
ISBN(印刷版)3540440380, 9783540440383
出版ステータスPublished - 2002
外部発表はい
イベント7th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2002 - Tokyo, Japan
継続期間: 2002 8 182002 8 22

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2417
ISSN(印刷版)03029743
ISSN(電子版)16113349

Other

Other7th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2002
CountryJapan
CityTokyo
Period02/8/1802/8/22

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

フィンガープリント 「Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル