557 search results - page 10 / 112 » Useful Transformations in Answer set programming |
180
click to vote
AAAI
2012
13 years 8 months ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
166
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
172
click to vote
JELIA
2004
Springer
15 years 11 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
194
click to vote
PADL
2005
Springer
15 years 11 months ago
2005
Springer
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 us...
147
click to vote
EXACT
2008
15 years 8 months ago
2008
This paper describes the problems with debugging tools for answer set programming, a declarative programming paradigm. Current approaches are difficult to use on most applications ...