20 search results - page 1 / 4 » lpnmr 2007 |
106
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
We introduce the logic-based planning language Kc as an extension of K [5]. Kc
117
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
We describe an answer-set programming solver smodels− , derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels− outp...
108
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s pre...
138
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
We show how to deploy the CIFF System 4.0 for abductive logic programming with constraints in a number of applications, ranging from combinatorial applications to web management. W...
129
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...