Exploiting (ir)relevance to guide problem-solving
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|exploiting (ir)relevance to guide problem-solving }}
- [[]]
bibtex
{{#vardefine:pagename|Exploiting (ir)relevance to guide problem-solving }}{{#vardefine:key| }}
abstract: Controlling inference in Artificial Intelligence (AI) systems that usedeclarative representations has always been a key issue in AI research. Theproblem arises because the problem-solver's search is unfocused and considersmany irrelevant facts. In the past, meta-level reasoning and creatingabstraction hierarchies have tried to deal with this problem. The notion ofirrelevance plays an important role in both fields. A significant type ofmeta-level control knowledge are statements about irrelevance of entities inthe representation to problem-solving goals. Given a goal, it is possible tostate that some entities in our KB are irrelevant to it and should thereforenot be used in the search for its solution. In the case of abstractions,defining the abstraction hierarchy is equivalent to stating what aspects ofthe domain are relevant at each level. I describe a framework in which meta-level control facts about (ir)relevance can be stated and subsequently used bya problem-solver. These control facts, called relevance-claims are stated ina declarative fashion, much the same way as the knowledge about the domain.The claims state relevance between problem-solving goals and entities in theKB. Their meaning is defined by the way they constrain the possible space ofdeductions that the problem-solver considers. The framework will be studiedand implemented on a device-modeling system and on the Cyc system.
download:
- paper:
- slides:
| Abstract | Controlling inference in Artificial Intell … Controlling inference in Artificial Intelligence (AI) systems that usedeclarative representations has always been a key issue in AI research. Theproblem arises because the problem-solver's search is unfocused and considersmany irrelevant facts. In the past, meta-level reasoning and creatingabstraction hierarchies have tried to deal with this problem. The notion ofirrelevance plays an important role in both fields. A significant type ofmeta-level control knowledge are statements about irrelevance of entities inthe representation to problem-solving goals. Given a goal, it is possible tostate that some entities in our KB are irrelevant to it and should thereforenot be used in the search for its solution. In the case of abstractions,defining the abstraction hierarchy is equivalent to stating what aspects ofthe domain are relevant at each level. I describe a framework in which meta-level control facts about (ir)relevance can be stated and subsequently used bya problem-solver. These control facts, called relevance-claims are stated ina declarative fashion, much the same way as the knowledge about the domain.The claims state relevance between problem-solving goals and entities in theKB. Their meaning is defined by the way they constrain the possible space ofdeductions that the problem-solver considers. The framework will be studiedand implemented on a device-modeling system and on the Cyc system. ice-modeling system and on the Cyc system. |
| Author | Alon Y. Halevy + |
| Bibtype | techreport + |
| Institution | Knowledge Systems, AI Laboratory + |
| Key | KSL-91-34 + |
| Month | May + |
| Number | KSL-91-34 + |
| Tag | Computer science + |
| Title | Exploiting (Ir)relevance to Guide Problem-solving + |
| Tr id | KSL-91-34 + |
| Year | 1991 + |
