Sciweavers

JAPLL
2007
135views more  JAPLL 2007»
13 years 3 months ago
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
JAPLL
2007
101views more  JAPLL 2007»
13 years 3 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...
JAPLL
2007
86views more  JAPLL 2007»
13 years 3 months ago
Using logical relevance for question answering
We propose a novel method of determining the appropriateness of an answer to a question through a proof of logical relevance rather than a logical proof of truth. We define logic...
Marco De Boni
JAPLL
2007
113views more  JAPLL 2007»
13 years 3 months ago
Fresh Logic: proof-theory and semantics for FM and nominal techniques
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...
Murdoch Gabbay
JAPLL
2007
52views more  JAPLL 2007»
13 years 3 months ago
Specifying and verifying interaction protocols in a temporal action logic
Laura Giordano, Alberto Martelli, Camilla Schwind