7 search results - page 2 / 2 » Nonmonotonic Ontological and Rule-Based Reasoning with Exten... |
RULEML
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
JAPLL
2007
13 years 4 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...