Reasoning over networks by symbolic methods

DOI10.1007/s002000050123zbMath0931.68142OpenAlexW2012398058MaRDI QIDQ1304767

Thomas Sturm

Publication date: 8 March 2000

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050123

zbMATH Keywords

error detectionnetwork analysiselectrical networksautomatic reasoningquantifier elimination procedurereal quantifier eliminationanalysis, sizing, and error diagnosis of physical networkstest point

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Analytic circuit theory (94C05) Applications of model theory (03C98) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (5)

Better answers to real questions ⋮ Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. ⋮ Linear problems in valued fields ⋮ Quantified set inversion algorithm with applications to control ⋮ Quantified constraints under perturbation

Uses Software

• QEPCAD
• REDLOG
• GUARDIAN

This page was built for publication: Reasoning over networks by symbolic methods