245 search results - page 5 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
AAAI
2008
13 years 9 months ago
2008
Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs....
ASP
2003
Springer
14 years 9 days ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
WLP
2007
Springer
14 years 1 months ago
2007
Springer
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...
AGP
2003
IEEE
14 years 11 days ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...