6978 search results - page 387 / 1396 » On Proofs in System P |
210
click to vote
DELOS
2004
15 years 8 months ago
2004
Databases and Grid computing are a good match. With the service orientation of Grid computing, the complexity of maintaining and integrating databases can be kept away from the act...
163
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
233
click to vote
RTA
1993
Springer
15 years 11 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
185
click to vote
FLAIRS
2000
15 years 8 months ago
2000
The paper presents a survey of the VSE system, a kind of CASE-tool for formal software development. It is a summary of a tutorial presentation describing methodology, formalisms, ...
207
Voted
SIGCOMM
2003
ACM
16 years 3 days ago
2003
ACM
Content-based full-text search is a challenging problem in Peer-toPeer (P2P) systems. Traditional approaches have either been centralized or use flooding to ensure accuracy of th...