Sciweavers

11381 search results - page 441 / 2277
» Connectivity
Sort
View
CONNECTION
2008
109views more  CONNECTION 2008»
15 years 7 months ago
Object schemas for grounding language in a responsive robot
We introduce an approach for physically-grounded natural language interpretation by robots which reacts appropriately to unanticipated physical changes in the environment and dyna...
Kai-yuh Hsiao, Stefanie Tellex, Soroush Vosoughi, ...
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 7 months ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky
DAM
2010
167views more  DAM 2010»
15 years 6 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
ENTCS
2010
88views more  ENTCS 2010»
15 years 6 months ago
On the Observable Behaviour of Composite Components
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
Rolf Hennicker, Stephan Janisch, Alexander Knapp
DM
2008
94views more  DM 2008»
15 years 6 months ago
On low degree k-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
Karola Mészáros