Sciweavers

809 search results - page 125 / 162
» Answer Formulation for Question-Answering
Sort
View
ASP
2005
Springer
14 years 2 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
FUIN
2006
145views more  FUIN 2006»
13 years 8 months ago
Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
Linh Anh Nguyen
LREC
2008
90views Education» more  LREC 2008»
13 years 10 months ago
Revealing Relations between Open and Closed Answers in Questionnaires through Text Clustering Evaluation
Open answers in questionnaires contain valuable information that is very time-consuming to analyze manually. We present a method for hypothesis generation from questionnaires base...
Magnus Rosell, Sumithra Velupillai
IJCNN
2000
IEEE
14 years 25 days ago
Extracting Distributed Representations of Concepts and Relations from Positive and Negative Propositions
Linear Relational Embedding (LRE) was introduced (Paccanaro and Hinton, 1999) as a means of extracting a distributed representation of concepts from relational data. The original ...
Alberto Paccanaro, Geoffrey E. Hinton
LPNMR
1999
Springer
14 years 21 days ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner