Simplification of quantifier free formulas over ordered fields:
Abstract: "Good simplification strategies are essential for implementing any kind of effective real quantifier elimination. Given a quantifier-free first-order formula over the theory of ordered fields, the aim is to find an equivalent first-order formula that is simpler. The notion of a formul...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1995
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1995,17 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Good simplification strategies are essential for implementing any kind of effective real quantifier elimination. Given a quantifier-free first-order formula over the theory of ordered fields, the aim is to find an equivalent first-order formula that is simpler. The notion of a formula being simpler will be specified. An overview is given over various methods, which we have implemented in REDUCE. Our methods have been developed for simplifying intermediate and final results of automatic quantifier elimination using elimination set ideas (Weispfenning, 1988, Loos and Weispfenning, 1993). They are, however, applicable to other elimination methods." |
| Beschreibung: | 25, 3 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010513135 | ||
| 003 | DE-604 | ||
| 005 | 19951206 | ||
| 007 | t | ||
| 008 | 951206s1995 |||| 00||| eng d | ||
| 035 | |a (OCoLC)35571484 | ||
| 035 | |a (DE-599)BVBBV010513135 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-384 |a DE-29T |a DE-91G |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 Simplification of quantifier free formulas over ordered fields |c A. Dolzmann ; Th. Sturm |
| 264 | 1 | |a Passau |c 1995 | |
| 300 | |a 25, 3 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 1995,17 | |
| 520 | 3 | |a Abstract: "Good simplification strategies are essential for implementing any kind of effective real quantifier elimination. Given a quantifier-free first-order formula over the theory of ordered fields, the aim is to find an equivalent first-order formula that is simpler. The notion of a formula being simpler will be specified. An overview is given over various methods, which we have implemented in REDUCE. Our methods have been developed for simplifying intermediate and final results of automatic quantifier elimination using elimination set ideas (Weispfenning, 1988, Loos and Weispfenning, 1993). They are, however, applicable to other elimination methods." | |
| 630 | 0 | 4 | |a REDUCE |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Algebra |x Data processing | |
| 650 | 4 | |a Elimination | |
| 650 | 4 | |a Ordered fields | |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 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 |
| 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 1995,17 |w (DE-604)BV000905393 |9 1995,17 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007007074 | ||
Datensatz im Suchindex
| _version_ | 1804124979378257920 |
|---|---|
| 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 | BV010513135 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)35571484 (DE-599)BVBBV010513135 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02242nam a2200445 cb4500</leader><controlfield tag="001">BV010513135</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951206 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951206s1995 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35571484</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010513135</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-384</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</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">Simplification of quantifier free formulas over ordered fields</subfield><subfield code="c">A. Dolzmann ; Th. Sturm</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25, 3 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">1995,17</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Good simplification strategies are essential for implementing any kind of effective real quantifier elimination. Given a quantifier-free first-order formula over the theory of ordered fields, the aim is to find an equivalent first-order formula that is simpler. The notion of a formula being simpler will be specified. An overview is given over various methods, which we have implemented in REDUCE. Our methods have been developed for simplifying intermediate and final results of automatic quantifier elimination using elimination set ideas (Weispfenning, 1988, Loos and Weispfenning, 1993). They are, however, applicable to other elimination methods."</subfield></datafield><datafield tag="630" ind1="0" ind2="4"><subfield code="a">REDUCE</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</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">Elimination</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ordered fields</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="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="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">1995,17</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1995,17</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007007074</subfield></datafield></record></collection> |
| id | DE-604.BV010513135 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:54:16Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007007074 |
| oclc_num | 35571484 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-384 DE-29T DE-91G DE-BY-TUM DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-384 DE-29T DE-91G DE-BY-TUM DE-634 |
| physical | 25, 3 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Dolzmann, Andreas Verfasser aut Simplification of quantifier free formulas over ordered fields A. Dolzmann ; Th. Sturm Passau 1995 25, 3 S. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1995,17 Abstract: "Good simplification strategies are essential for implementing any kind of effective real quantifier elimination. Given a quantifier-free first-order formula over the theory of ordered fields, the aim is to find an equivalent first-order formula that is simpler. The notion of a formula being simpler will be specified. An overview is given over various methods, which we have implemented in REDUCE. Our methods have been developed for simplifying intermediate and final results of automatic quantifier elimination using elimination set ideas (Weispfenning, 1988, Loos and Weispfenning, 1993). They are, however, applicable to other elimination methods." REDUCE Datenverarbeitung Algebra Data processing Elimination Ordered fields Mathematik (DE-588)4037944-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-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> 1995,17 (DE-604)BV000905393 1995,17 |
| spellingShingle | Dolzmann, Andreas Sturm, Thomas Simplification of quantifier free formulas over ordered fields REDUCE Datenverarbeitung Algebra Data processing Elimination Ordered fields Mathematik (DE-588)4037944-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4037944-9 (DE-588)4196735-5 (DE-588)4026894-9 |
| title | Simplification of quantifier free formulas over ordered fields |
| title_auth | Simplification of quantifier free formulas over ordered fields |
| title_exact_search | Simplification of quantifier free formulas over ordered fields |
| title_full | Simplification of quantifier free formulas over ordered fields A. Dolzmann ; Th. Sturm |
| title_fullStr | Simplification of quantifier free formulas over ordered fields A. Dolzmann ; Th. Sturm |
| title_full_unstemmed | Simplification of quantifier free formulas over ordered fields A. Dolzmann ; Th. Sturm |
| title_short | Simplification of quantifier free formulas over ordered fields |
| title_sort | simplification of quantifier free formulas over ordered fields |
| topic | REDUCE Datenverarbeitung Algebra Data processing Elimination Ordered fields Mathematik (DE-588)4037944-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | REDUCE Datenverarbeitung Algebra Data processing Elimination Ordered fields Mathematik Theoretische Informatik Informatik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT dolzmannandreas simplificationofquantifierfreeformulasoverorderedfields AT sturmthomas simplificationofquantifierfreeformulasoverorderedfields |