180 search results - page 29 / 36 » Self-Assembly of Infinite Structures |
ATVA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
COCO
2008
Springer
13 years 11 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
AI
2008
Springer
13 years 9 months ago
2008
Springer
It is well-known that knowledgebases may contain inconsistencies. We provide a framework of measures, based on a first-order four-valued logic, to quantify the inconsistency of a ...
DAM
2008
13 years 9 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
AUTOMATICA
2006
13 years 9 months ago
2006
Abstract-- The Saint-Venant equations describe the dynamics of one dimensional open-channel flow. The paper investigates linearized Saint-Venant equations modes and their control. ...