Reasoning over networks by symbolic methods

Authors
Citation
T. Sturm, Reasoning over networks by symbolic methods, APPL ALG EN, 10(1), 1999, pp. 79-96
Citations number
32
Categorie Soggetti
Engineering Mathematics
Journal title
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
ISSN journal
09381279 → ACNP
Volume
10
Issue
1
Year of publication
1999
Pages
79 - 96
Database
ISI
SICI code
0938-1279(199909)10:1<79:RONBSM>2.0.ZU;2-Q
Abstract
Effective quantifier elimination procedures for the reals allow to solve pr oblems that can be encoded into corresponding first-order formulas includin g ordering constraints. In contrast to constraint logic programming, which is often used in similar areas, this encoding is straightforward, A quantif ier elimination procedure using test point ideas is part of the package RED LOG by the author ct al. REDLOG is part of REDUCE 3.7. We discuss how this method can be used for analysis, sizing, and error diagnosis of physical ne tworks. The focus is on electrical networks.