90 search results - page 7 / 18 » Automated theorem proving in quasigroup and loop theory |
CSL
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
TIME
2008
IEEE
14 years 1 months ago
2008
IEEE
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...
PTS
2010
13 years 4 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
QEST
2007
IEEE
14 years 29 days ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...