86 search results - page 10 / 18 » Models and quantifier elimination for quantified Horn formul... |
JAR
2006
13 years 7 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
ISORC
2003
IEEE
14 years 23 days ago
2003
IEEE
Quality and risk concerns currently limit the application of commercial off-the-shelf (COTS) software components to non-critical applications. Software metrics can quantify factor...
FORTE
2004
13 years 9 months ago
2004
Abstract. We apply the PEPA nets modelling language to modelling a peer-topeer medical informatics application, the FieldCare PDA-based medical records system developed by SINTEF T...
APAL
2000
13 years 7 months ago
2000
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...