2022 search results - page 233 / 405 » Complexity of Non-Monotonic Logics |
150
click to vote
FSTTCS
2007
Springer
16 years 19 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
180
click to vote
KES
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
200
click to vote
OTM
2007
Springer
16 years 18 days ago
2007
Springer
As more semantic web services become on the Internet, it is feasible that users collaborate among them to save efforts in complex web solutions by sharing and reusing existing sema...
150
click to vote
FPL
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Increasing logic resources coupled with a proliferation of integrated performance enhancing primitives in high-end FPGAs results in an increased design complexity which r...
183
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...