Sciweavers

344 search results - page 30 / 69
» Some Theorems We Should Prove
Sort
View
AI
2007
Springer
13 years 7 months ago
Iterated belief revision, revised
The AGM postulates for belief revision, augmented by the DP postulates for iterated belief revision, provide generally accepted criteria for the design of operators by which intel...
Yi Jin, Michael Thielscher
ICML
1989
IEEE
13 years 11 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 4 months ago
A Categorical Outlook on Cellular Automata
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
Silvio Capobianco, Tarmo Uustalu
MICS
2010
81views more  MICS 2010»
13 years 5 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
ESORICS
2010
Springer
13 years 8 months ago
Enforcing Secure Object Initialization in Java
Sun and the CERT recommend for secure Java development to not allow partially initialized objects to be accessed. The CERT considers the severity of the risks taken by not followin...
Laurent Hubert, Thomas P. Jensen, Vincent Monfort,...