network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
Fuzzy Description Logics (DLs) are a family of logics which allow the representation of (and the reasoning within) structured knowledge affected by vagueness. Although a relativel...
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...