Reasoning over networks by symbolic methods:
Abstract: "Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In contrast to constraint logic programming, which is often used in similar areas, this encoding is straightfo...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Passau
1997
|
| Series: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1997,19 |
| Subjects: | |
| Summary: | Abstract: "Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In contrast to constraint logic programming, which is often used in similar areas, this encoding is straightforward. A quantifier elimination procedure using test point ideas is part of the REDUCE package REDLOG by the author et. al, which is freely available to the scientific community. We discuss how this method can be used for analysis, sizing, and error diagnosis of physical networks. The focus is on electrical networks." |
| Physical Description: | 21, 5 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011747586 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 980203s1997 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)41080287 | ||
| 035 | |a (DE-599)BVBBV011747586 | ||
| 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 | ||
| 100 | 1 | |a Sturm, Thomas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Reasoning over networks by symbolic methods |c Th. Sturm |
| 264 | 1 | |a Passau |c 1997 | |
| 300 | |a 21, 5 S. |b graph. Darst. | ||
| 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,19 | |
| 520 | 3 | |a Abstract: "Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In contrast to constraint logic programming, which is often used in similar areas, this encoding is straightforward. A quantifier elimination procedure using test point ideas is part of the REDUCE package REDLOG by the author et. al, which is freely available to the scientific community. We discuss how this method can be used for analysis, sizing, and error diagnosis of physical networks. The focus is on electrical networks." | |
| 650 | 4 | |a Electrical networks topology | |
| 650 | 4 | |a Elimination | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a System analysis | |
| 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 | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1997,19 |w (DE-604)BV000905393 |9 1997,19 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007926368 | |
Record in the Search Index
| _version_ | 1820882317854375936 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Sturm, Thomas |
| author_facet | Sturm, Thomas |
| author_role | aut |
| author_sort | Sturm, Thomas |
| author_variant | t s ts |
| building | Verbundindex |
| bvnumber | BV011747586 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)41080287 (DE-599)BVBBV011747586 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV011747586</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">980203s1997 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)41080287</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011747586</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="100" ind1="1" ind2=" "><subfield code="a">Sturm, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reasoning over networks by symbolic methods</subfield><subfield code="c">Th. 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">21, 5 S.</subfield><subfield code="b">graph. Darst.</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,19</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In contrast to constraint logic programming, which is often used in similar areas, this encoding is straightforward. A quantifier elimination procedure using test point ideas is part of the REDUCE package REDLOG by the author et. al, which is freely available to the scientific community. We discuss how this method can be used for analysis, sizing, and error diagnosis of physical networks. The focus is on electrical networks."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical networks topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Elimination</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">System analysis</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="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,19</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1997,19</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007926368</subfield></datafield></record></collection> |
| id | DE-604.BV011747586 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:04:59Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007926368 |
| oclc_num | 41080287 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-634 |
| physical | 21, 5 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Sturm, Thomas Verfasser aut Reasoning over networks by symbolic methods Th. Sturm Passau 1997 21, 5 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1997,19 Abstract: "Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In contrast to constraint logic programming, which is often used in similar areas, this encoding is straightforward. A quantifier elimination procedure using test point ideas is part of the REDUCE package REDLOG by the author et. al, which is freely available to the scientific community. We discuss how this method can be used for analysis, sizing, and error diagnosis of physical networks. The focus is on electrical networks." Electrical networks topology Elimination Logic programming System analysis 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 Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1997,19 (DE-604)BV000905393 1997,19 |
| spellingShingle | Sturm, Thomas Reasoning over networks by symbolic methods Electrical networks topology Elimination Logic programming System analysis 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 | Reasoning over networks by symbolic methods |
| title_auth | Reasoning over networks by symbolic methods |
| title_exact_search | Reasoning over networks by symbolic methods |
| title_full | Reasoning over networks by symbolic methods Th. Sturm |
| title_fullStr | Reasoning over networks by symbolic methods Th. Sturm |
| title_full_unstemmed | Reasoning over networks by symbolic methods Th. Sturm |
| title_short | Reasoning over networks by symbolic methods |
| title_sort | reasoning over networks by symbolic methods |
| topic | Electrical networks topology Elimination Logic programming System analysis Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Electrical networks topology Elimination Logic programming System analysis Theoretische Informatik Informatik Mathematik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT sturmthomas reasoningovernetworksbysymbolicmethods |