29908 search results - page 362 / 5982 » On the Complexity of |
189
click to vote
ECP
1997
Springer
15 years 11 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
157
click to vote
VL
1996
IEEE
15 years 11 months ago
1996
IEEE
An often-mentioned advantage of rule-based programming languages is that a program can be extended simply by adding a few more rules. In practice however, the rules tend to be dep...
182
Voted
MFCS
1997
Springer
15 years 11 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
165
click to vote
ICDE
1993
IEEE
15 years 11 months ago
1993
IEEE
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...
211
click to vote
STACS
1994
Springer
15 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...