580 search results - page 2 / 116 » On the Foundations of Answer Set Programming |
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
We present a new answer set solver, called nomore++, along with its underlying theoretical foundations. A distinguishing feature is that it treats heads and bodies equitably as com...
KR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set p...
IJCAI
1989
13 years 7 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
DKE
2010
13 years 5 months ago
2010
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...