2214 search results - page 125 / 443 » Complexity of Reasoning |
159
click to vote
JODS
2007
15 years 3 months ago
2007
Abstract. A viable ontology engineering methodology requires supporting domain experts in gradually building and managing increasingly complex versions of ontological elements and ...
126
click to vote
DLOG
2008
15 years 5 months ago
2008
Distributed Description Logics (DDL) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping. Subsumption propagation in DD...
131
click to vote
CISC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
252
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
133
click to vote
VMCAI
2010
Springer
16 years 18 days ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...