149 search results - page 6 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
KR
2000
Springer
15 years 6 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
142
click to vote
AAAI
2000
15 years 3 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
115
click to vote
ENTCS
2006
15 years 2 months ago
2006
Community decisions about access control in virtual communities are non-monotonic in nature. This means that they cannot be expressed in current, monotonic trust management langua...
130
click to vote
KR
2010
Springer
15 years 7 months ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
140
click to vote
LPNMR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...