858 search results - page 74 / 172 » Planning and defeasible reasoning |
223
Voted
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
AEI
2004
15 years 19 days ago
2004
The estimation of productivity rates in cyclic construction processes is a difficult, but essential task in the planning of construction projects. The conventional method--a calcu...
132
Voted
DALT
2005
Springer
15 years 6 months ago
2005
Springer
Developing applications that make effective use of machine-readable knowledge sources as promised by the Semantic Web vision is attracting much of current research interest; this v...
101
Voted
IJCAI
1993
15 years 2 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
147
click to vote
CONSTRAINTS
1998
15 years 13 days ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...