Sciweavers

662 search results - page 44 / 133
» Formalizing Basic First Order Model Theory
Sort
View
CCS
2008
ACM
13 years 9 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
ATAL
2008
Springer
13 years 9 months ago
Internal models and private multi-agent belief revision
We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the singleagent case, based on the notion of interpretation, to th...
Guillaume Aucher
CIKM
2008
Springer
13 years 9 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
IR
2008
13 years 7 months ago
A probability ranking principle for interactive information retrieval
The classical Probability Ranking Principle (PRP) forms the theoretical basis for probabilistic Information Retrieval (IR) models, which are dominating IR theory since about 20 ye...
Norbert Fuhr
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 5 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...