4573 search results - page 335 / 915 » Automated Reasoning |
185
click to vote
KGC
1997
Springer
15 years 11 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
249
click to vote
KGC
1997
Springer
15 years 11 months ago
1997
Springer
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic t...
166
click to vote
LPNMR
1997
Springer
15 years 11 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
176
click to vote
LICS
1993
IEEE
15 years 11 months ago
1993
IEEE
This paper presents an untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called delegation-based object-oriented languages. A type infer...
170
Voted
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
The notion of a bilattice was rst proposed by Ginsberg as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting....