Sciweavers

454 search results - page 31 / 91
» Representation results for defeasible logic
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements
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...
Carlos Morra, João M. P. Cardoso, Jürg...
UAI
2008
13 years 10 months ago
Sampling First Order Logical Particles
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...
Hannaneh Hajishirzi, Eyal Amir
KI
2006
Springer
13 years 8 months ago
A New n-ary Existential Quantifier in Description Logics
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...
EMNLP
2007
13 years 10 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
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...
Luke S. Zettlemoyer, Michael Collins
MLQ
2002
83views more  MLQ 2002»
13 years 8 months ago
Pseudomonadic Algebras as Algebraic Models of Doxastic Modal Logic
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...
Nick Bezhanishvili