Sciweavers

1667 search results - page 35 / 334
» Extended clause learning
Sort
View
IANDC
2008
116views more  IANDC 2008»
13 years 7 months ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CHI
2005
ACM
14 years 8 months ago
Polymorphic letters: transforming pen movements to extend written expression
We are developing a digital writing tool, Polymorphic Letters (PL), to investigate hand and pen movements as they may extend and enrich expression in written language. PL recogniz...
Andrea Taylor, Zoltan Foley-Fisher, Carol Stroheck...
ALT
1999
Springer
14 years 12 hour ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
BC
2007
98views more  BC 2007»
13 years 7 months ago
Extending the mirror neuron system model, I
The paper introduces mirror neuron system II (MNS2), a new version of the MNS model (Oztop and Arbib in Biol Cybern 87(2):116–140, 2002) of action recognition learning by mirror ...
James Bonaiuto, Edina Rosta, Michael A. Arbib
DAGSTUHL
2001
13 years 9 months ago
Extended Static Checking: A Ten-Year Perspective
A powerful approach to finding errors in computer software is to translate a given program into a verification condition, a logical formula that is valid if and only if the program...
K. Rustan M. Leino