4617 search results - page 367 / 924 » Automation of Diagrammatic Reasoning |
165
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...
173
click to vote
LICS
1993
IEEE
15 years 10 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...
169
Voted
LICS
1994
IEEE
15 years 10 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....
166
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of nite structures if every (FO + LFP) formula is equivalent to a rst-order formula in K. H...
172
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...