Sciweavers

7055 search results - page 140 / 1411
» Some New 4-Designs
Sort
View
DM
2008
107views more  DM 2008»
15 years 5 months ago
Set maps, umbral calculus, and the chromatic polynomial
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...
Gus Wiseman
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
15 years 5 months ago
Approximation of feasibility tests for reactive walk on HRP-2
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
Nicolas Perrin, Olivier Stasse, Florent Lamiraux, ...
JELIA
2010
Springer
15 years 5 months ago
dl2asp: Implementing Default Logic via Answer Set Programming
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
Yin Chen, Hai Wan, Yan Zhang, Yi Zhou
ACL
2010
15 years 4 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
DLOG
2010
15 years 4 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide