Valtorta, M. "Some Results on Knowledge Base Refinement with an Oracle." Technical Report TR89005, Department of Computer Science, University of South Carolina, April 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Complexity of Belief Network Synthesis and Refinement - Valtorta, Loveland (1992) Self-citation (Valtorta) (Correct)
No context found.
Valtorta, M. "Some Results on Knowledge Base Refinement with an Oracle." Technical Report TR89005, Department of Computer Science, University of South Carolina, April 1989.
On the Complexity of Belief Network Synthesis and Refinement - Valtorta, Loveland (1992) Self-citation (Valtorta) (Correct)
No context found.
Valtorta, M . "Some Resu lts on Knowledge Base Refinemen t with an Oracle." Techn ical Report TR89005, Departmen t of Compu ter Science, Un iversity of Sou th Carolina, April 1989.
Some Results On the Computational Complexity of Refining.. - Valtorta Self-citation (Valtorta) (Correct)
.... D rastal and Kulikowski [13] Politakis [29] G insberg [19] wh ile the view that diagnostic expert system s can be trained to ou tpu t a usable certain ty factor as well as a class and that cases include certain ty factors is held in ( Rada [30,31] Fu and Buchanan [15] Caruana [8] Valtorta [40 42]) Adam s continues to show that a diagnosis with a h igher certainty factor is not necessarily more probable than 19 one with a lower certain ty factor, and therefore that MYCIN behaves irrationally, in the sense of ( Buchanan and Shortliffe [7, chapter 11] Select other window and hit enter ....
....strengths to the correct ones. If the expert given strengths are accurate predictors of winners, this technique is successful. A ll strengths internal to the tree can be set to one ( i.e. elim inated) without loss of generality, as shown by Val 23 torta [40 42]. To guaran tee the run time bound given above, step 2 shou ld be solved using the algorithm by Megiddo [27] 24 Select other window and hit enter to continue. ## ## 23 An example of use of this algorithm on the inference net of Figure 12 is the following. Let the expert given strengths be ( ....
[Article contains additional citation context not shown here]
Valtorta, M . "Some Resu lts on Knowledge-base Refinemen t with an Oracle." Techn ical Report TR89005, Departmen t of Compu ter Science, Un iversity of Sou th Carolina, Columbia, 1989.
Refinement of Uncertain Rule Bases via Reduction - Ling, Valtorta (1995) (3 citations) Self-citation (Valtorta) (Correct)
....base unchanged. Rule base synthesis, on the other hand, is the process of constructing a new rule base from a set of cases. Thus synthesis is a special form of refinement: it is a refinement from an empty rule base. In this paper, we study both refinement and synthesis problems. It was proved [Valtorta, 1989, Valtorta, 1991b] that many refinement and synthesis problems in simple rule bases are NP hard. These rule bases are simple in the sense that they are very shallow (but not flat) and have only a small number of intermediate terms. See the references and Section 4 for a more precise description. ....
Valtorta, M. (1989). Some results on knowledge base refinement with an oracle. Technical Report TR89005, Department of Computer Science, University of South Carolina.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC