Sciweavers

85
Voted
AAAI
1993
15 years 2 months ago
Reasoning With Characteristic Models
Formal AI systems traditionally represent knowledge using logical formulas. We will show, however, that for certain kinds of information, a modelbased representation is more compa...
Henry A. Kautz, Michael J. Kearns, Bart Selman
88
Voted
AAAI
1998
15 years 2 months ago
Computing Intersections of Horn Theories for Reasoning with Models
We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We pre...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
CCS
2008
ACM
15 years 3 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
120
Voted
CSFW
2009
IEEE
15 years 5 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
79
Voted
ALT
2009
Springer
15 years 10 months ago
Canonical Horn Representations and Query Learning
Abstract. We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a n...
Marta Arias, José L. Balcázar