13026 search results - page 466 / 2606 » Probabilistic Relational Models |
165
click to vote
APPINF
2003
15 years 7 months ago
2003
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
172
click to vote
TRS
2008
15 years 6 months ago
2008
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
196
Voted
ML
2011
ACM
15 years 1 months ago
2011
ACM
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
164
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
160
click to vote
ECSQARU
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we conside...