4573 search results - page 813 / 915 » Automated Reasoning |
144
click to vote
LPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
113
click to vote
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Answer-set programming (ASP) has become an important paradigm for declarative problem solving in recent years. However, to further improve the usability of answer-set programs, the...
118
click to vote
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
141
click to vote
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
134
click to vote
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...