112 search results - page 2 / 23 » Graph-based induction and its applications |
131
click to vote
APAL
2011
14 years 4 months ago
2011
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
ENTCS
2006
14 years 9 months ago
2006
We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers an...
APVIS
2006
14 years 11 months ago
2006
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
IEICET
2007
14 years 9 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
AI
2003
Springer
15 years 2 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...