ISBN-13: 9783836413060 / Angielski / Miękka / 2007 / 128 str.
ISBN-13: 9783836413060 / Angielski / Miękka / 2007 / 128 str.
This work investigates the quantifier elimination problem in real closed fields with respect to the application in description logics. The motivation for the investigation in this topic is mainly based on the demand for an extension of description logic systems to support a default concrete domain for non-linear multivariate equations and inequations. The authors provide a literature overview that summarizes main mathematical tools for checking whether a set of non-linear multivariate (in-)equatins is satisfiable (quantifier elimination problem). The authors shortly describe how application examples are handled with a prototype implementation.
This work investigates the quantifier elimination problem in real closed fieldswith respect to the application in description logics. The motivation for theinvestigation in this topic is mainly based on the demand for an extension ofdescription logic systems to support a default concrete domain for non-linearmultivariate equations and inequations. The authors provide a literatureoverview that summarizes main mathematical tools for checking whether aset of non-linear multivariate (in-)equatins is satisfiable (quantifier eliminationproblem). The authors shortly describe how application examples are handledwith a prototype implementation.