190
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
157
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
137
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
This workpresents a newlogical characterization of well foundedsemanticsthat provides, as interesting innovation, a fully semantic-oriented treatment of programconnectives without...
137
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract Howard A. Blair EECSDept., 2-177 SciTech Syracuse University Syracuse, NY13210 USA
140
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...