Sciweavers

115 search results - page 23 / 23
» Type Inference for Recursive Definitions
Sort
View
AAAI
1998
13 years 6 months ago
Probabilistic Frame-Based Systems
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
Daphne Koller, Avi Pfeffer
ICFP
2005
ACM
14 years 5 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
NMR
2004
Springer
13 years 10 months ago
A probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
Miodrag Raskovic, Zoran Ognjanovic, Zoran Markovic
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
13 years 9 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
SBBD
2004
119views Database» more  SBBD 2004»
13 years 6 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link