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

Yutaka Matsuo; Mitsuru Ishizuka

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

Yutaka Matsuo, Mitsuru Ishizuka

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	118-127
Number of pages	10
Volume	2417
ISBN (Print)	3540440380, 9783540440383
Publication status	Published - 2002
Externally published	Yes
Event	7th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2002 - Tokyo, Japan Duration: 2002 Aug 18 → 2002 Aug 22

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2417
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	7th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2002
Country/Territory	Japan
City	Tokyo
Period	02/8/18 → 02/8/22

ASJC Scopus subject areas

Computer Science(all)
Theoretical Computer Science

Cite this

Matsuo, Y., & Ishizuka, M. (2002). Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2417, pp. 118-127). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2417). Springer Verlag.

Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning. / Matsuo, Yutaka; Ishizuka, Mitsuru.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2417 Springer Verlag, 2002. p. 118-127 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2417).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Matsuo, Y & Ishizuka, M 2002, Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2417, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2417, Springer Verlag, pp. 118-127, 7th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2002, Tokyo, Japan, 02/8/18.

Matsuo Y, Ishizuka M. Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2417. Springer Verlag. 2002. p. 118-127. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Matsuo, Yutaka ; Ishizuka, Mitsuru. / Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2417 Springer Verlag, 2002. pp. 118-127 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d3dc4b19688748a8a479941c644e74ad,

title = "Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning",

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

author = "Yutaka Matsuo and Mitsuru Ishizuka",

year = "2002",

language = "English",

isbn = "3540440380",

volume = "2417",

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

publisher = "Springer Verlag",

pages = "118--127",

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

note = "7th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2002 ; Conference date: 18-08-2002 Through 22-08-2002",

}

TY - GEN

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

AU - Matsuo, Yutaka

AU - Ishizuka, Mitsuru

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947939993&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947939993&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947939993

SN - 3540440380

SN - 9783540440383

VL - 2417

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 118

EP - 127

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

T2 - 7th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2002

Y2 - 18 August 2002 through 22 August 2002

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this