505 search results - page 7 / 101 » Answer Set Programming with Templates |
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
107
Voted
AGP
2003
IEEE
15 years 2 months 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 ...
LPNMR
2009
Springer
15 years 2 months ago
2009
Springer
This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicabilit...
IAT
2008
IEEE
15 years 4 months ago
2008
IEEE
In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation.