2585 search results - page 333 / 517 » computing 1999 |
154
Voted
ECP
1997
Springer
15 years 8 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
141
click to vote
ECP
1997
Springer
15 years 8 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...
134
click to vote
ECP
1997
Springer
15 years 8 months ago
1997
Springer
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
131
Voted
HPCN
1997
Springer
15 years 7 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
150
Voted
DLOG
2001
15 years 5 months ago
2001
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...