3244 search results - page 391 / 649 » Extensions to Description Logics |
206
click to vote
TIME
2006
IEEE
16 years 21 days ago
2006
IEEE
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
161
Voted
LPNMR
2005
Springer
16 years 5 days ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
172
click to vote
TLCA
2005
Springer
16 years 5 days ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
172
click to vote
DFT
2004
IEEE
15 years 10 months ago
2004
IEEE
Quantum dot Cellular Automata (QCA) is amongst promising new computing scheme in the nano-scale regimes. As an emerging technology, QCA relies on radically different operations in...
201
click to vote
ESWS
2006
Springer
15 years 10 months ago
2006
Springer
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...