2214 search results - page 141 / 443 » Complexity of Reasoning |
121
Voted
ILP
2000
Springer
15 years 7 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
131
Voted
FLAIRS
2007
15 years 5 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
124
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
114
click to vote
DOCENG
2008
ACM
15 years 5 months ago
2008
ACM
: Variable data documents can be considered as functions of their bindings to values, and this function could be arbitrarily complex to build strongly-customised but high-value doc...
147
click to vote
LREC
2010
15 years 4 months ago
2010
Abstract. This paper describes recent approaches using text-mining to automatically profile and extract arguments from legal cases. We outline some of the background context and mo...