2911 search results - page 183 / 583 » A Logic of Graph Constraints |
214
click to vote
TLCA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...
197
click to vote
WLP
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. We present a framework for a declarative approach to spatiotemporal reasoning on geographical data, based on the constraint logical language STACLP, which offers deducti...
151
click to vote
CADE
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
155
click to vote
CCCG
2003
15 years 8 months ago
2003
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
168
click to vote
JLP
2010
15 years 5 months ago
2010
Abstract. ComputationalsystemsareoftenrepresentedbymeansofKripkestructures, and related using simulations. We propose rewriting logic as a flexible and executable framework in whi...