Skip to main content
Log in

Reasoning over Networks by Symbolic Methods

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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 package REDLOG by the author et al. REDLOG is part of REDUCE 3.7. We discuss how this method can be used for analysis, sizing, and error diagnosis of physical networks. The focus is on electrical networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 19, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sturm, T. Reasoning over Networks by Symbolic Methods. AAECC 10, 79–96 (1999). https://doi.org/10.1007/s002000050123

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050123

Navigation