A flexible marker-passer for semantically weak search

Kevin Gary, Jennifer J. Elgot-Drapkin

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

Abstract

New challenges posed in many areas of AI research represent a departure from domain-specific applications-To systems that can more effectively cope with larger and more uncertain domains. Such knowledge intensive applications require the easy and efficient utilization of tremendous amounts of knowledge. The magnitude of knowledge and often stringent response constraints that characterize such applications poses a computationally prohibitive search problem. A proposed technique for addressing this problem is a parallel search technique known as marker-passing. Past work in markerpassers has shown they often return too much information, becoming a bottleneck of the system in which they are embedded. This paper presents the design of a flexible marker-passing mechanism embedded in a commonsense reasoning model, RABIT (Reasoning About Beliefs In Time), which overcomes this difficulty. The unique design we present avoids traditional drawbacks in markerpassing implementations by emphasizing search over inference as the goal of the marker-passing process. This marker-passing design is powerful due to its separation of the marker-passing process from the knowledge contained in the network itselL thus allowing for its potential use not only in the area of commonsense reasoning, but also in many other domains, including, but not limited to, natural language processing, general-purpose planning, and robot navigation.

Original languageEnglish (US)
Title of host publicationProceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994
PublisherAssociation for Computing Machinery
Pages313-317
Number of pages5
VolumePart F129433
ISBN (Electronic)0897916476
DOIs
StatePublished - Apr 6 1994
Externally publishedYes
Event1994 ACM Symposium on Applied Computing, SAC 1994 - Phoenix, United States
Duration: Mar 6 1994Mar 8 1994

Other

Other1994 ACM Symposium on Applied Computing, SAC 1994
CountryUnited States
CityPhoenix
Period3/6/943/8/94

Fingerprint

Navigation
Robots
Planning
Processing

Keywords

  • Commonsense reasoning
  • Connectionist models
  • Knowledge representation
  • Marker-passing
  • Search

ASJC Scopus subject areas

  • Software

Cite this

Gary, K., & Elgot-Drapkin, J. J. (1994). A flexible marker-passer for semantically weak search. In Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994 (Vol. Part F129433, pp. 313-317). Association for Computing Machinery. https://doi.org/10.1145/326619.326765

A flexible marker-passer for semantically weak search. / Gary, Kevin; Elgot-Drapkin, Jennifer J.

Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994. Vol. Part F129433 Association for Computing Machinery, 1994. p. 313-317.

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

Gary, K & Elgot-Drapkin, JJ 1994, A flexible marker-passer for semantically weak search. in Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994. vol. Part F129433, Association for Computing Machinery, pp. 313-317, 1994 ACM Symposium on Applied Computing, SAC 1994, Phoenix, United States, 3/6/94. https://doi.org/10.1145/326619.326765
Gary K, Elgot-Drapkin JJ. A flexible marker-passer for semantically weak search. In Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994. Vol. Part F129433. Association for Computing Machinery. 1994. p. 313-317 https://doi.org/10.1145/326619.326765
Gary, Kevin ; Elgot-Drapkin, Jennifer J. / A flexible marker-passer for semantically weak search. Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994. Vol. Part F129433 Association for Computing Machinery, 1994. pp. 313-317
@inproceedings{66b5e6616d664d1a8571b58613bd19f7,
title = "A flexible marker-passer for semantically weak search",
abstract = "New challenges posed in many areas of AI research represent a departure from domain-specific applications-To systems that can more effectively cope with larger and more uncertain domains. Such knowledge intensive applications require the easy and efficient utilization of tremendous amounts of knowledge. The magnitude of knowledge and often stringent response constraints that characterize such applications poses a computationally prohibitive search problem. A proposed technique for addressing this problem is a parallel search technique known as marker-passing. Past work in markerpassers has shown they often return too much information, becoming a bottleneck of the system in which they are embedded. This paper presents the design of a flexible marker-passing mechanism embedded in a commonsense reasoning model, RABIT (Reasoning About Beliefs In Time), which overcomes this difficulty. The unique design we present avoids traditional drawbacks in markerpassing implementations by emphasizing search over inference as the goal of the marker-passing process. This marker-passing design is powerful due to its separation of the marker-passing process from the knowledge contained in the network itselL thus allowing for its potential use not only in the area of commonsense reasoning, but also in many other domains, including, but not limited to, natural language processing, general-purpose planning, and robot navigation.",
keywords = "Commonsense reasoning, Connectionist models, Knowledge representation, Marker-passing, Search",
author = "Kevin Gary and Elgot-Drapkin, {Jennifer J.}",
year = "1994",
month = "4",
day = "6",
doi = "10.1145/326619.326765",
language = "English (US)",
volume = "Part F129433",
pages = "313--317",
booktitle = "Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - A flexible marker-passer for semantically weak search

AU - Gary, Kevin

AU - Elgot-Drapkin, Jennifer J.

PY - 1994/4/6

Y1 - 1994/4/6

N2 - New challenges posed in many areas of AI research represent a departure from domain-specific applications-To systems that can more effectively cope with larger and more uncertain domains. Such knowledge intensive applications require the easy and efficient utilization of tremendous amounts of knowledge. The magnitude of knowledge and often stringent response constraints that characterize such applications poses a computationally prohibitive search problem. A proposed technique for addressing this problem is a parallel search technique known as marker-passing. Past work in markerpassers has shown they often return too much information, becoming a bottleneck of the system in which they are embedded. This paper presents the design of a flexible marker-passing mechanism embedded in a commonsense reasoning model, RABIT (Reasoning About Beliefs In Time), which overcomes this difficulty. The unique design we present avoids traditional drawbacks in markerpassing implementations by emphasizing search over inference as the goal of the marker-passing process. This marker-passing design is powerful due to its separation of the marker-passing process from the knowledge contained in the network itselL thus allowing for its potential use not only in the area of commonsense reasoning, but also in many other domains, including, but not limited to, natural language processing, general-purpose planning, and robot navigation.

AB - New challenges posed in many areas of AI research represent a departure from domain-specific applications-To systems that can more effectively cope with larger and more uncertain domains. Such knowledge intensive applications require the easy and efficient utilization of tremendous amounts of knowledge. The magnitude of knowledge and often stringent response constraints that characterize such applications poses a computationally prohibitive search problem. A proposed technique for addressing this problem is a parallel search technique known as marker-passing. Past work in markerpassers has shown they often return too much information, becoming a bottleneck of the system in which they are embedded. This paper presents the design of a flexible marker-passing mechanism embedded in a commonsense reasoning model, RABIT (Reasoning About Beliefs In Time), which overcomes this difficulty. The unique design we present avoids traditional drawbacks in markerpassing implementations by emphasizing search over inference as the goal of the marker-passing process. This marker-passing design is powerful due to its separation of the marker-passing process from the knowledge contained in the network itselL thus allowing for its potential use not only in the area of commonsense reasoning, but also in many other domains, including, but not limited to, natural language processing, general-purpose planning, and robot navigation.

KW - Commonsense reasoning

KW - Connectionist models

KW - Knowledge representation

KW - Marker-passing

KW - Search

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

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

U2 - 10.1145/326619.326765

DO - 10.1145/326619.326765

M3 - Conference contribution

VL - Part F129433

SP - 313

EP - 317

BT - Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994

PB - Association for Computing Machinery

ER -