3229 search results - page 211 / 646 » Theories with the Independence Property |
155
click to vote
OTM
2007
Springer
16 years 20 days ago
2007
Springer
Development of ontology development tools and ontology-enhanced software applications requires thorough understanding of ontology languages in order to implement them according to ...
175
click to vote
FOSSACS
2004
Springer
15 years 12 months ago
2004
Springer
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
150
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
160
click to vote
FOSSACS
2003
Springer
15 years 11 months ago
2003
Springer
We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers h...
166
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...