8228 search results - page 160 / 1646 » Structural Logical Relations |
TPHOL
2005
IEEE
14 years 4 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
JSYML
2011
13 years 5 months ago
2011
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
ICES
2007
Springer
14 years 5 days ago
2007
Springer
Abstract. Fault Tolerance is an increasing challenge for integrated circuits due to semiconductor technology scaling. This paper looks at how artificial evolution may be tuned to ...
JSYML
2000
13 years 10 months ago
2000
Let K0 be the class of structures , <, A , where A is disjoint from a club, and let K1 be the class of structures , <, A , where A contains a club. We prove that if = &...
KCAP
2005
ACM
14 years 4 months ago
2005
ACM
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...