Guarded expressions in practice:
Abstract: "Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x/x becomes 1 dropping the case x=0. We claim that it is feasible in practice to compute also the degenerate cases yielding guarded expressions. We work over real closed fields but our id...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1997
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1997,02 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x/x becomes 1 dropping the case x=0. We claim that it is feasible in practice to compute also the degenerate cases yielding guarded expressions. We work over real closed fields but our ideas about handling guarded expression can be easily transferred to other situations. Using formulas as guards provides a powerful tool for heuristically reducing the combinatorial explosion of cases: equivalent, redundant, tautological, and contradictive cases can be detected by simplification and quantifier elimination. Our approach allows to simplify the expressions on the basis of simplification knowledge on the logical side. The method described in this paper is implemented in the REDUCE package GUARDIAN, which is freely available on the WWW." |
| Beschreibung: | 19, 5 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011190072 | ||
| 003 | DE-604 | ||
| 005 | 19970407 | ||
| 007 | t | ||
| 008 | 970206s1997 |||| 00||| eng d | ||
| 035 | |a (OCoLC)38179109 | ||
| 035 | |a (DE-599)BVBBV011190072 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-634 | ||
| 084 | |a SS 5600 |0 (DE-625)143571: |2 rvk | ||
| 100 | 1 | |a Dolzmann, Andreas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Guarded expressions in practice |c Andreas Dolzmann and Thomas Sturm |
| 264 | 1 | |a Passau |c 1997 | |
| 300 | |a 19, 5 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1997,02 | |
| 520 | 3 | |a Abstract: "Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x/x becomes 1 dropping the case x=0. We claim that it is feasible in practice to compute also the degenerate cases yielding guarded expressions. We work over real closed fields but our ideas about handling guarded expression can be easily transferred to other situations. Using formulas as guards provides a powerful tool for heuristically reducing the combinatorial explosion of cases: equivalent, redundant, tautological, and contradictive cases can be detected by simplification and quantifier elimination. Our approach allows to simplify the expressions on the basis of simplification knowledge on the logical side. The method described in this paper is implemented in the REDUCE package GUARDIAN, which is freely available on the WWW." | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Algebra |x Data processing | |
| 650 | 4 | |a Computer science |x Mathematics | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Sturm, Thomas |e Verfasser |4 aut | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1997,02 |w (DE-604)BV000905393 |9 1997,02 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007504663 | ||
Datensatz im Suchindex
| _version_ | 1804125686153084928 |
|---|---|
| any_adam_object | |
| author | Dolzmann, Andreas Sturm, Thomas |
| author_facet | Dolzmann, Andreas Sturm, Thomas |
| author_role | aut aut |
| author_sort | Dolzmann, Andreas |
| author_variant | a d ad t s ts |
| building | Verbundindex |
| bvnumber | BV011190072 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)38179109 (DE-599)BVBBV011190072 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02399nam a2200445 cb4500</leader><controlfield tag="001">BV011190072</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970407 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970206s1997 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38179109</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011190072</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-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5600</subfield><subfield code="0">(DE-625)143571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dolzmann, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Guarded expressions in practice</subfield><subfield code="c">Andreas Dolzmann and Thomas Sturm</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19, 5 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">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1997,02</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x/x becomes 1 dropping the case x=0. We claim that it is feasible in practice to compute also the degenerate cases yielding guarded expressions. We work over real closed fields but our ideas about handling guarded expression can be easily transferred to other situations. Using formulas as guards provides a powerful tool for heuristically reducing the combinatorial explosion of cases: equivalent, redundant, tautological, and contradictive cases can be detected by simplification and quantifier elimination. Our approach allows to simplify the expressions on the basis of simplification knowledge on the logical side. The method described in this paper is implemented in the REDUCE package GUARDIAN, which is freely available on the WWW."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sturm, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1997,02</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1997,02</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007504663</subfield></datafield></record></collection> |
| id | DE-604.BV011190072 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:05:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007504663 |
| oclc_num | 38179109 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-634 |
| physical | 19, 5 S. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Dolzmann, Andreas Verfasser aut Guarded expressions in practice Andreas Dolzmann and Thomas Sturm Passau 1997 19, 5 S. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1997,02 Abstract: "Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x/x becomes 1 dropping the case x=0. We claim that it is feasible in practice to compute also the degenerate cases yielding guarded expressions. We work over real closed fields but our ideas about handling guarded expression can be easily transferred to other situations. Using formulas as guards provides a powerful tool for heuristically reducing the combinatorial explosion of cases: equivalent, redundant, tautological, and contradictive cases can be detected by simplification and quantifier elimination. Our approach allows to simplify the expressions on the basis of simplification knowledge on the logical side. The method described in this paper is implemented in the REDUCE package GUARDIAN, which is freely available on the WWW." Datenverarbeitung Informatik Mathematik Algebra Data processing Computer science Mathematics Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Sturm, Thomas Verfasser aut Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1997,02 (DE-604)BV000905393 1997,02 |
| spellingShingle | Dolzmann, Andreas Sturm, Thomas Guarded expressions in practice Datenverarbeitung Informatik Mathematik Algebra Data processing Computer science Mathematics Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)4037944-9 |
| title | Guarded expressions in practice |
| title_auth | Guarded expressions in practice |
| title_exact_search | Guarded expressions in practice |
| title_full | Guarded expressions in practice Andreas Dolzmann and Thomas Sturm |
| title_fullStr | Guarded expressions in practice Andreas Dolzmann and Thomas Sturm |
| title_full_unstemmed | Guarded expressions in practice Andreas Dolzmann and Thomas Sturm |
| title_short | Guarded expressions in practice |
| title_sort | guarded expressions in practice |
| topic | Datenverarbeitung Informatik Mathematik Algebra Data processing Computer science Mathematics Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Datenverarbeitung Informatik Mathematik Algebra Data processing Computer science Mathematics Theoretische Informatik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT dolzmannandreas guardedexpressionsinpractice AT sturmthomas guardedexpressionsinpractice |