Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving

dc.creatorRatschan,Stefan
dc.date2000
dc.date.accessioned2024-02-06T12:50:47Z
dc.date.available2024-02-06T12:50:47Z
dc.descriptionWhen trying to solve quantified constraints (i.e., first-order formulas over the real numbers) exactly, one faces the following problems: First, constants coming from measurements are often only approximately given. Second, solving such constraints is in general undecidable and for special cases highly complex. Third, exact solutions are often extremely complicated symbolic expressions. In this paper we study how to do approximate computation instead of working on approximate inputs and producing approximate output. For this we show how quantiffied constraints can be viewed as expressions in heterogeneous algebra and study how to do uncertainty propagation there. Since set theory is a very fundamental approach for representing uncertainty, also here we represent uncertainty by sets. Our considerations result in a general framework for approximate computation that can be applied in various different domains.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-006-09-0861
dc.identifierhttps://lib.jucs.org/article/27714/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7813
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 6(9): 861-880
dc.subjectconstraints
dc.subjectuncertainty
dc.subjectinterval computation
dc.subjectcomputational logic
dc.titleUncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving
dc.typeResearch Article
Файлы