Sciweavers

1536 search results - page 139 / 308
» The Underlying Logic of Hoare Logic
Sort
View
DLOG
2011
14 years 10 months ago
Local Closed World Semantics: Keep it simple, stupid!
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzl...
ENTCS
2007
124views more  ENTCS 2007»
15 years 6 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
LFCS
2009
Springer
16 years 27 days ago
A Labeled Natural Deduction System for a Fragment of CTL*
We give a sound and complete labeled natural deduction system for an interesting fragment of CTL∗ , namely the until-free version of BCTL∗ . The logic BCTL∗ is obtained by re...
Andrea Masini, Luca Viganò, Marco Volpe
SEAAI
1998
Springer
15 years 10 months ago
Using knowledge nodes for knowledge discovery and collaboration
Today most of the information we produce is stored digitally. We are slowly forced to leave behind us thinking about information as something stored in physical containers as books...
Per Christiansson
APAL
2008
90views more  APAL 2008»
15 years 6 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger