16666 search results - page 53 / 3334 » Descriptive and Computational Complexity |
180
Voted
CPE
1994
Springer
15 years 7 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
139
click to vote
LREC
2010
15 years 5 months ago
2010
Ontology-based semantic annotation aims at putting fragments of a text in correspondence with proper elements of an ontology such that the formal semantics encoded by the ontology...
119
Voted
DLOG
2007
15 years 5 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
115
Voted
COMCOM
2000
15 years 3 months ago
2000
This paper is devoted to the presentation of the RT-LOTOS formal description technique, which is a formalism suited for applications where concurrency, complex synchronization pat...
116
click to vote
LFCS
2009
Springer
15 years 10 months ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...