705 search results - page 8 / 141 » Approximating Extended Answer Sets |
77
Voted
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
JAR
2007
14 years 9 months ago
2007
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to u...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
LPNMR
2005
Springer
15 years 3 months 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
14 years 9 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...