1791 search results - page 257 / 359 » Semantics and Complexity of SPARQL |
154
click to vote
KR
2000
Springer
15 years 8 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
133
click to vote
DLOG
2004
15 years 5 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
151
click to vote
AAAI
1990
15 years 5 months ago
1990
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
146
click to vote
ENTCS
2006
15 years 4 months ago
2006
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex one...
130
click to vote
TIP
2008
15 years 4 months ago
2008
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...