Principles and algorithms for causal reasoning with uncertainty:
Abstract: "This thesis examines representational issues that arise when reasoning about causes and effects given incomplete and uncertain knowledge about the domain. These issues are largely covered by the famous frame and qualification problems. This thesis shows how traditional nonmonotonic l...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Rochester, NY
1989
|
Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
287 |
Schlagworte: | |
Zusammenfassung: | Abstract: "This thesis examines representational issues that arise when reasoning about causes and effects given incomplete and uncertain knowledge about the domain. These issues are largely covered by the famous frame and qualification problems. This thesis shows how traditional nonmonotonic logic approaches can be modified to address these problems in a simple, domain-dependent way. This nonmonotonic approach is then generalized to manipulate statistically-founded beliefs, allowing for more consistent and fine-grained representation for causal knowledge. In addition, this thesis presents an algorithmic approach for efficient parallel computation of statistical predictions. This approach involves two heuristics, highest impact first and highest impact remaining, which control the speed of convergence and error estimation for an algorithm that iteratively refines degrees of belief. This algorithm has been implemented and tested by a program called HITEST, which runs on parallel hardware." |
Beschreibung: | Rochester, NY, Univ., Diss. |
Beschreibung: | VII, 102 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008948961 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1989 m||| 00||| eng d | ||
035 | |a (OCoLC)21419812 | ||
035 | |a (DE-599)BVBBV008948961 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
050 | 0 | |a QA331.5 | |
100 | 1 | |a Weber, Jay C. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Principles and algorithms for causal reasoning with uncertainty |c by Jay Charles Weber |
264 | 1 | |a Rochester, NY |c 1989 | |
300 | |a VII, 102 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 287 | |
500 | |a Rochester, NY, Univ., Diss. | ||
520 | 3 | |a Abstract: "This thesis examines representational issues that arise when reasoning about causes and effects given incomplete and uncertain knowledge about the domain. These issues are largely covered by the famous frame and qualification problems. This thesis shows how traditional nonmonotonic logic approaches can be modified to address these problems in a simple, domain-dependent way. This nonmonotonic approach is then generalized to manipulate statistically-founded beliefs, allowing for more consistent and fine-grained representation for causal knowledge. In addition, this thesis presents an algorithmic approach for efficient parallel computation of statistical predictions. This approach involves two heuristics, highest impact first and highest impact remaining, which control the speed of convergence and error estimation for an algorithm that iteratively refines degrees of belief. This algorithm has been implemented and tested by a program called HITEST, which runs on parallel hardware." | |
650 | 4 | |a Mathematical statistics | |
650 | 4 | |a Monotonic functions | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 287 |w (DE-604)BV008902697 |9 287 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005904681 |
Datensatz im Suchindex
_version_ | 1804123281962303488 |
---|---|
any_adam_object | |
author | Weber, Jay C. |
author_facet | Weber, Jay C. |
author_role | aut |
author_sort | Weber, Jay C. |
author_variant | j c w jc jcw |
building | Verbundindex |
bvnumber | BV008948961 |
callnumber-first | Q - Science |
callnumber-label | QA331 |
callnumber-raw | QA331.5 |
callnumber-search | QA331.5 |
callnumber-sort | QA 3331.5 |
callnumber-subject | QA - Mathematics |
ctrlnum | (OCoLC)21419812 (DE-599)BVBBV008948961 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02149nam a2200337 cb4500</leader><controlfield tag="001">BV008948961</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21419812</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008948961</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA331.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Weber, Jay C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Principles and algorithms for causal reasoning with uncertainty</subfield><subfield code="c">by Jay Charles Weber</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 102 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">287</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Rochester, NY, Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This thesis examines representational issues that arise when reasoning about causes and effects given incomplete and uncertain knowledge about the domain. These issues are largely covered by the famous frame and qualification problems. This thesis shows how traditional nonmonotonic logic approaches can be modified to address these problems in a simple, domain-dependent way. This nonmonotonic approach is then generalized to manipulate statistically-founded beliefs, allowing for more consistent and fine-grained representation for causal knowledge. In addition, this thesis presents an algorithmic approach for efficient parallel computation of statistical predictions. This approach involves two heuristics, highest impact first and highest impact remaining, which control the speed of convergence and error estimation for an algorithm that iteratively refines degrees of belief. This algorithm has been implemented and tested by a program called HITEST, which runs on parallel hardware."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical statistics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Monotonic functions</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Rochester <Rochester, NY></subfield><subfield code="v">287</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">287</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005904681</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV008948961 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:17Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005904681 |
oclc_num | 21419812 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | VII, 102 S. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
record_format | marc |
series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
spelling | Weber, Jay C. Verfasser aut Principles and algorithms for causal reasoning with uncertainty by Jay Charles Weber Rochester, NY 1989 VII, 102 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 287 Rochester, NY, Univ., Diss. Abstract: "This thesis examines representational issues that arise when reasoning about causes and effects given incomplete and uncertain knowledge about the domain. These issues are largely covered by the famous frame and qualification problems. This thesis shows how traditional nonmonotonic logic approaches can be modified to address these problems in a simple, domain-dependent way. This nonmonotonic approach is then generalized to manipulate statistically-founded beliefs, allowing for more consistent and fine-grained representation for causal knowledge. In addition, this thesis presents an algorithmic approach for efficient parallel computation of statistical predictions. This approach involves two heuristics, highest impact first and highest impact remaining, which control the speed of convergence and error estimation for an algorithm that iteratively refines degrees of belief. This algorithm has been implemented and tested by a program called HITEST, which runs on parallel hardware." Mathematical statistics Monotonic functions (DE-588)4113937-9 Hochschulschrift gnd-content Department of Computer Science: Technical report University of Rochester <Rochester, NY> 287 (DE-604)BV008902697 287 |
spellingShingle | Weber, Jay C. Principles and algorithms for causal reasoning with uncertainty Mathematical statistics Monotonic functions |
subject_GND | (DE-588)4113937-9 |
title | Principles and algorithms for causal reasoning with uncertainty |
title_auth | Principles and algorithms for causal reasoning with uncertainty |
title_exact_search | Principles and algorithms for causal reasoning with uncertainty |
title_full | Principles and algorithms for causal reasoning with uncertainty by Jay Charles Weber |
title_fullStr | Principles and algorithms for causal reasoning with uncertainty by Jay Charles Weber |
title_full_unstemmed | Principles and algorithms for causal reasoning with uncertainty by Jay Charles Weber |
title_short | Principles and algorithms for causal reasoning with uncertainty |
title_sort | principles and algorithms for causal reasoning with uncertainty |
topic | Mathematical statistics Monotonic functions |
topic_facet | Mathematical statistics Monotonic functions Hochschulschrift |
volume_link | (DE-604)BV008902697 |
work_keys_str_mv | AT weberjayc principlesandalgorithmsforcausalreasoningwithuncertainty |