96 search results - page 1 / 20 » An Optimization for Reasoning with Forest Logic Programs |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
ESWS
2009
Springer
13 years 11 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
JAPLL
2007
13 years 5 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...
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
