705 search results - page 1 / 141 » Approximating Extended Answer Sets |
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, whil...
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
SDM
2003
SIAM
13 years 6 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...
AMAI
2004
Springer
13 years 4 months ago
2004
Springer
We present systems of logic programming agents (LPAS) to model the interactions between decision-makers while evolving to a conclusion. Such a system consists of a number of agents...