1056 search results - page 71 / 212 » ijcai 2007 |
IJCAI
1993
14 years 11 months ago
1993
Though arrangement knowledge is well suited for qualitative representations of spatial situations, if we only use this kind of knowledge, we cannot do interesting inferences about...
74
Voted
IJCAI
1993
14 years 11 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
IJCAI
1993
14 years 11 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
IJCAI
1989
14 years 11 months ago
1989
We Imbed Into a first order logic a representation language that combines atemporal knowledge with time stamps in a hierarchical fashion. Each time structure contains its own chro...
80
Voted
IJCAI
1989
14 years 11 months ago
1989
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...