194 search results - page 25 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
116
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
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...
105
click to vote
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
133
click to vote
ICLP
2003
Springer
15 years 5 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...