2490 search results - page 193 / 498 » Complexity of Contextual Reasoning |
135
Voted
ILP
2000
Springer
15 years 8 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...
148
click to vote
FLAIRS
2007
15 years 7 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...
150
click to vote
DLOG
2008
15 years 7 months ago
2008
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
134
click to vote
CSL
2008
Springer
15 years 6 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...
130
click to vote
DOCENG
2008
ACM
15 years 6 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...