89 search results - page 8 / 18 » ijcai 1993 |
IJCAI
1993
13 years 8 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
1993
13 years 8 months ago
1993
The paper is concerned with the design of a module system for logic programming so as to satisfy many of the requirements of software en gineering. The design is based on the la...
IJCAI
1993
13 years 8 months ago
1993
Gelfond and Lifschitz introduce a declarative language A for describing effects of actions and define a translation of theories in this language into extended logic programs(ELP, ...
IJCAI
1993
13 years 8 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
13 years 8 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...