Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
14,449
Definitorially complete description logics
- In Proceedings of the International Conference of Principles of Knowledge Representation and Reasoning
, 2006
"... knowledge base is used to define new concepts in terms of primitive concepts and relations. The topic of this paper is the effect of the available operations in a DL on the length and the syntactic shape of definitions in a Terminology Box. Defining new concepts can be done in two ways: (1) in an ex ..."
Abstract
-
Cited by 27 (2 self)
- Add to MetaCart
is on the following property of DL’s: every new concept defined in the implicit way can also be defined in the explicit manner. DL’s with this property are called Definitorially Complete. It is known that ALC is definitorially complete. We provide a concrete algorithm for computing explicit definitions on the basis
An Almost Complete Description of Perfect . . .
, 2005
"... Let G i=1 C # i be a direct product of cycles. It is proved that for any r # 1, and any n # 2, each connected component of G contains an r-perfect code provided that each # i is a multiple of r . ..."
Abstract
- Add to MetaCart
Let G i=1 C # i be a direct product of cycles. It is proved that for any r # 1, and any n # 2, each connected component of G contains an r-perfect code provided that each # i is a multiple of r .
RACER system description
, 2001
"... Abstract. RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms. RACER also implements a decision procedure for modal logic satisfiability proble ..."
Abstract
-
Cited by 452 (41 self)
- Add to MetaCart
Abstract. RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms. RACER also implements a decision procedure for modal logic satisfiability
The SimpleScalar tool set, version 2.0
- Computer Architecture News
, 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and high-performance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract
-
Cited by 1844 (43 self)
- Add to MetaCart
, better documentation, easier installation, improved portability, and higher performance. This report contains a complete description of the tool set, including retrieval and installation instructions, a description of how to use the tools, a description of the target SimpleScalar architecture, and many
Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression
, 1988
"... A three-layered neural network is described for transforming two-dimensional discrete signals into generalized nonorthogonal 2-D “Gabor” representations for image analysis, segmentation, and compression. These transforms are conjoint spatial/spectral representations [lo], [15], which provide a comp ..."
Abstract
-
Cited by 478 (8 self)
- Add to MetaCart
complete image description in terms of locally windowed 2-D spectral coordinates embedded within global 2-D spatial coordinates. Because intrinsic redundancies within images are extracted, the resulting image codes can be very compact. However, these conjoint transforms are inherently difficult to compute
Dynamic Logic
- Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract
-
Cited by 1012 (7 self)
- Add to MetaCart
possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not effective; however, it is quite useful as a descriptive tool. A more conventional way to obtain a
Complete Description of Idempotent Hedges in Fuzzy Logic
, 2014
"... Abstract In describing expert knowledge, it is often important to properly take into account hedges like "very", "somewhat", etc. In particular, fuzzy logic provides a consistent way of describing hedges. For some of the hedges, a repetition changes the meaning: e.g., "very ..."
Abstract
- Add to MetaCart
;very very small" is smaller than "very small". However, other hedges -like "somewhat" -are idempotent, in the sense that repeating this hedge twice does not change the meaning. In this paper, we provide a complete description of such idempotent hedges.
Pushing the EL envelope
- In Proc. of IJCAI 2005
, 2005
"... Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already int ..."
Abstract
-
Cited by 461 (59 self)
- Add to MetaCart
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already
Results 1 - 10
of
14,449
