34 search results - page 4 / 7 » The Second Answer Set Programming Competition |
LPNMR
2007
Springer
14 years 12 days ago
2007
Springer
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
ICLP
1994
Springer
13 years 10 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
SIGECOM
2005
ACM
13 years 12 months ago
2005
ACM
We investigate the class of single-round, sealed-bid auctions for a set of identical items in unlimited supply. We adopt the worst-case competitive framework defined by [8, 4] th...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
LPNMR
2001
Springer
13 years 10 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...