7167 search results - page 55 / 1434 » Answer Set Programming |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
ACL
2009
13 years 5 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
LOPSTR
1994
Springer
13 years 12 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
AICOM
2006
13 years 7 months ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...