6978 search results - page 274 / 1396 » On Proofs in System P |
185
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The perfor...
175
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The ...
167
click to vote
APAL
1999
15 years 6 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
185
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
174
Voted
CADE
1999
Springer
15 years 11 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...