2035 search results - page 80 / 407 » On the complexity of stratified logics |
138
click to vote
IAT
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
204
click to vote
JAPLL
2010
15 years 4 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
166
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
157
click to vote
INFOCOM
2007
IEEE
16 years 15 days ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
146
click to vote
ELPUB
2006
ACM
16 years 5 days ago
2006
ACM
A text parsing component designed to be part of a system that assists students in academic reading an writing is presented. The parser can automatically add a relational discourse...