4573 search results - page 336 / 915 » Automated Reasoning |
167
click to vote
LICS
1994
IEEE
15 years 11 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...
173
click to vote
LICS
1994
IEEE
15 years 11 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 ...
167
Voted
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
203
click to vote
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
171
click to vote
ELP
1993
15 years 11 months ago
1993
Abstract. This paper presents work on programming methodologies for the programming tool GCLA. Three methods are discussed which show how to construct the control part of a GCLA pr...