3658 search results - page 202 / 732 » The logic of proofs, semantically |
235
click to vote
AMAI
1999
Springer
15 years 6 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
202
click to vote
TCS
2011
15 years 1 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
169
click to vote
RP
2009
Springer
16 years 1 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
129
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper describes the Signature Compiler, which can compile an LF signature to a custom proof checker in either C++ or Java, specialized for that signature. Empirical results a...
228
click to vote
ER
1995
Springer
15 years 10 months ago
1995
Springer
We describe a (meta) formalism for defining a variety of (object oriented) data models in a unified framework based on a variation of first-order logic. As specific example we use...