Sciweavers

432 search results - page 12 / 87
» Open answer set programming for the semantic web
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Type Checking in Open-Domain Question Answering
Open domain question answering (QA) systems have to bridge the potential vocabulary mismatch between a question and its candidate answers. One can view this as a recall problem and...
Stefan Schlobach, Marius Olsthoorn, Maarten de Rij...
JAPLL
2007
101views more  JAPLL 2007»
13 years 8 months ago
Data-driven type checking in open domain question answering
Many open domain question answering systems answer questions by first harvesting a large number of candidate answers, and then picking the most promising one from the list. One c...
Stefan Schlobach, David Ahn, Maarten de Rijke, Val...
RR
2010
Springer
13 years 6 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
LPNMR
2004
Springer
14 years 1 months ago
Reasoning About Actions and Change in Answer Set Programming
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
Yannis Dimopoulos, Antonis C. Kakas, Loizos Michae...
LOGCOM
2010
128views more  LOGCOM 2010»
13 years 6 months ago
Answer Set Programming with Resources
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
Stefania Costantini, Andrea Formisano