1000 search results - page 151 / 200 » Nominal rewriting systems |
IANDC
2006
13 years 8 months ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
JAR
2006
13 years 8 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
SIAMCOMP
2008
13 years 8 months ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
TOG
2008
13 years 8 months ago
2008
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
KI
2007
Springer
13 years 8 months ago
2007
Springer
Various forms of reasoning, the profusion of knowledge, the gap between neuro-inspired approaches and conceptual representations, the problem of inconsistent data input, and the ma...