169 search results - page 9 / 34 » Semantic forgetting in answer set programming |
LPNMR
2005
Springer
14 years 29 days ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
JELIA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Nonmonotonic causal logic became a basis for the semantics of several expressive action languages. Norman McCain and Paolo Ferraris showed how to embed propositional caus...
AAAI
2000
13 years 8 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 ...
LPNMR
2004
Springer
14 years 25 days 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...