454 search results - page 31 / 91 » Representation results for defeasible logic |
117
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
106
Voted
UAI
2008
15 years 2 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
96
Voted
KI
2006
Springer
15 years 15 days ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
96
Voted
EMNLP
2007
15 years 2 months ago
2007
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
93
Voted
MLQ
2002
15 years 7 days ago
2002
We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudo...