932 search results - page 20 / 187 » Where in the Wikipedia Is That Answer |
LREC
2008
13 years 9 months ago
2008
This paper presents ongoing work dedicated to parsing the textual structure of procedural texts. We propose here a model for the intructional structure and criteria to identify it...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. 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...
AGP
2003
IEEE
14 years 28 days 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 ...
NMR
2004
Springer
14 years 1 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
on Uncertain Data (Extended Abstract) Ming Hua Jian Pei Wenjie Zhang Xuemin Lin Simon Fraser University, Canada The University of New South Wales & NICTA {mhua, jpei}@cs.sfu.c...