Sciweavers

1716 search results - page 286 / 344
» Proving Conditional Termination
Sort
View
121
Voted
IJAIT
2006
106views more  IJAIT 2006»
15 years 23 days ago
An Empirical Evaluation of Automated Theorem Provers in Software Certification
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
Ewen Denney, Bernd Fischer 0002, Johann Schumann
INFSOF
2006
117views more  INFSOF 2006»
15 years 23 days ago
A high concurrency XPath-based locking protocol for XML databases
Providing efficient access to XML documents becomes crucial in XML database systems. More and more concurrency control protocols for XML database systems were proposed in the past...
Kuen-Fang Jack Jea, Shih-Ying Chen
101
Voted
JIIS
2008
89views more  JIIS 2008»
15 years 23 days ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
103
Voted
JMLR
2008
94views more  JMLR 2008»
15 years 23 days ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
108
Voted
JAPLL
2006
112views more  JAPLL 2006»
15 years 23 days ago
Intuitionistic hybrid logic
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first const...
Torben Braüner, Valeria de Paiva