Sciweavers

2225 search results - page 353 / 445
» Logical Structures in the Lexicon
Sort
View
AIML
2004
13 years 9 months ago
On Notions of Completeness Weaker than Kripke Completeness
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
Tadeusz Litak
CATA
2001
13 years 9 months ago
Object-oriented image database model
: In this paper we analyze some existing tools and approaches to image data modeling and we propose an Object-Oriented Image Data (OOID) model. It can be applied on a wide variety ...
William I. Grosky, Peter L. Stanchev
DLOG
2001
13 years 9 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
CATA
2003
13 years 9 months ago
A Genetic Algorithm Approach to Static Task Scheduling in a Reconfigurable Hardware Environment
This paper presents a basic framework for applying static task scheduling techniques to arbitrarily-structured task systems whose targeted execution environment is comprised of fi...
Sin Ming Loo, B. Earl Wells, J. D. Winningham
IJCAI
2003
13 years 9 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...