5084 search results - page 20 / 1017 » Proving Possibility Properties |
DM
2008
13 years 10 months ago
2008
Given a simple graph G on n vertices, we prove that it is possible to reconstruct several algebraic properties of the edge ideal from the deck of G, that is, from the collection o...
ACL
1990
13 years 11 months ago
1990
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
ICCS
2001
Springer
14 years 2 months ago
2001
Springer
GRM and PROVE were originally designed and implemented as part of the P-GRADE graphical parallel program development environment running on clusters. In the framework of the bigges...
VVEIS
2008
13 years 11 months ago
2008
This paper presents an executable semantics of OO models. We made it possible to conduct both simulation and theorem proving on the semantics by implementing its underlying heap me...
ERSHOV
2009
Springer
14 years 4 months ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...