Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution

Yukio Ohsawa, Mitsuru Ishizuka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A hypothetical reasoning is an important knowledge system's framework because of its theoretical basis and its usefulness for practical problems including diagnosis, design, etc. One crucial problem with the hypothetical reasoning is, however, its slow inference speed. In order to achieve practical or tractable speed, polynomial-time approximate solution method of equivalent 0-1 integer programming, i.e., pivot and complement method, has been applied to computing hypothetical reasoning. However, to achieve further improvement by considering the knowledge structure of a given problem, it is beneficial to have another inference method which can work in knowledge domain rather than mathematical programming domain. For this purpose, the above method is reformalized in this paper using a new type of network. By taking advantage of the knowledge structure, this network achieves an inference speed in the order of 0(N2) against N, where N indicates problem size.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Tools with Artificial Intelligence
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages184-187
Number of pages4
ISBN (Print)0818642009
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93 - Boston, MA, USA
Duration: 1993 Nov 81993 Nov 11

Other

OtherProceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93
CityBoston, MA, USA
Period93/11/893/11/11

Fingerprint

Polynomials
Mathematical programming
Integer programming

ASJC Scopus subject areas

  • Software

Cite this

Ohsawa, Y., & Ishizuka, M. (1993). Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution. In Anon (Ed.), Proceedings of the International Conference on Tools with Artificial Intelligence (pp. 184-187). Piscataway, NJ, United States: Publ by IEEE.

Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution. / Ohsawa, Yukio; Ishizuka, Mitsuru.

Proceedings of the International Conference on Tools with Artificial Intelligence. ed. / Anon. Piscataway, NJ, United States : Publ by IEEE, 1993. p. 184-187.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ohsawa, Y & Ishizuka, M 1993, Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution. in Anon (ed.), Proceedings of the International Conference on Tools with Artificial Intelligence. Publ by IEEE, Piscataway, NJ, United States, pp. 184-187, Proceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93, Boston, MA, USA, 93/11/8.
Ohsawa Y, Ishizuka M. Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution. In Anon, editor, Proceedings of the International Conference on Tools with Artificial Intelligence. Piscataway, NJ, United States: Publ by IEEE. 1993. p. 184-187
Ohsawa, Yukio ; Ishizuka, Mitsuru. / Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution. Proceedings of the International Conference on Tools with Artificial Intelligence. editor / Anon. Piscataway, NJ, United States : Publ by IEEE, 1993. pp. 184-187
@inproceedings{68f2925ae71a43b28339a4ef9aae819b,
title = "Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution",
abstract = "A hypothetical reasoning is an important knowledge system's framework because of its theoretical basis and its usefulness for practical problems including diagnosis, design, etc. One crucial problem with the hypothetical reasoning is, however, its slow inference speed. In order to achieve practical or tractable speed, polynomial-time approximate solution method of equivalent 0-1 integer programming, i.e., pivot and complement method, has been applied to computing hypothetical reasoning. However, to achieve further improvement by considering the knowledge structure of a given problem, it is beneficial to have another inference method which can work in knowledge domain rather than mathematical programming domain. For this purpose, the above method is reformalized in this paper using a new type of network. By taking advantage of the knowledge structure, this network achieves an inference speed in the order of 0(N2) against N, where N indicates problem size.",
author = "Yukio Ohsawa and Mitsuru Ishizuka",
year = "1993",
language = "English",
isbn = "0818642009",
pages = "184--187",
editor = "Anon",
booktitle = "Proceedings of the International Conference on Tools with Artificial Intelligence",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Networked bubble propagation method as a polynomial-time hypothetical reasoning for computing quasi-optimal solution

AU - Ohsawa, Yukio

AU - Ishizuka, Mitsuru

PY - 1993

Y1 - 1993

N2 - A hypothetical reasoning is an important knowledge system's framework because of its theoretical basis and its usefulness for practical problems including diagnosis, design, etc. One crucial problem with the hypothetical reasoning is, however, its slow inference speed. In order to achieve practical or tractable speed, polynomial-time approximate solution method of equivalent 0-1 integer programming, i.e., pivot and complement method, has been applied to computing hypothetical reasoning. However, to achieve further improvement by considering the knowledge structure of a given problem, it is beneficial to have another inference method which can work in knowledge domain rather than mathematical programming domain. For this purpose, the above method is reformalized in this paper using a new type of network. By taking advantage of the knowledge structure, this network achieves an inference speed in the order of 0(N2) against N, where N indicates problem size.

AB - A hypothetical reasoning is an important knowledge system's framework because of its theoretical basis and its usefulness for practical problems including diagnosis, design, etc. One crucial problem with the hypothetical reasoning is, however, its slow inference speed. In order to achieve practical or tractable speed, polynomial-time approximate solution method of equivalent 0-1 integer programming, i.e., pivot and complement method, has been applied to computing hypothetical reasoning. However, to achieve further improvement by considering the knowledge structure of a given problem, it is beneficial to have another inference method which can work in knowledge domain rather than mathematical programming domain. For this purpose, the above method is reformalized in this paper using a new type of network. By taking advantage of the knowledge structure, this network achieves an inference speed in the order of 0(N2) against N, where N indicates problem size.

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

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

M3 - Conference contribution

AN - SCOPUS:0027875058

SN - 0818642009

SP - 184

EP - 187

BT - Proceedings of the International Conference on Tools with Artificial Intelligence

A2 - Anon, null

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -