Sciweavers

4617 search results - page 881 / 924
» Automation of Diagrammatic Reasoning
Sort
View
NMR
2004
Springer
15 years 7 months ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari
CRYPTO
2000
Springer
134views Cryptology» more  CRYPTO 2000»
15 years 6 months ago
Taming the Adversary
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
Martín Abadi
IJCAI
2003
15 years 3 months ago
Abductive Matchmaking using Description Logics
Motivated by the matchmaking problem in electronic marketplaces, we study abduction in Description Logics. We devise suitable definitions of the problem, and show how they can mod...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
IJCAI
1993
15 years 3 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
IANDC
2008
105views more  IANDC 2008»
15 years 2 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...