2911 search results - page 231 / 583 » A Logic of Graph Constraints |
166
click to vote
SPATIALCOGNITION
2000
Springer
15 years 10 months ago
2000
Springer
We present an approach to spatial inference which is based on the procedural semantics of spatial relations. In contrast to qualitative reasoning, we do not use discrete symbolic m...
209
click to vote
SBBD
2007
15 years 8 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
177
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
193
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
222
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...