408 search results - page 79 / 82 » Reasoning with Very Expressive Fuzzy Description Logics |
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
MCMASTER
1993
13 years 11 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
IJBRA
2007
13 years 7 months ago
2007
: In this paper we explore issues in the development of the my Grid ontology, which is an OWL ontology designed to support service discovery through service annotation. There are c...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
FMCAD
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...