Sciweavers

149 search results - page 23 / 30
» Argumentation Semantics for Defeasible Logics
Sort
View
FOIS
2006
15 years 3 months ago
A Reusable Ontology for Fluents in OWL
A critical problem for practical KR is dealing with relationships that change over time. This problem is compounded by representation languages such as OWL that are biased towards ...
Christopher A. Welty, Richard Fikes
125
Voted
FCT
2005
Springer
15 years 7 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
117
Voted
CSFW
2006
IEEE
15 years 8 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
130
Voted
APAL
2008
104views more  APAL 2008»
15 years 2 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
IJIS
2008
115views more  IJIS 2008»
15 years 1 months ago
A new semantics for ACL based on commitments and penalties
Abstract. In complex multi agent systems, the agents may be heterogeneous and possibly designed by different programmers. Thus, the importance of defining a standard framework for ...
Leila Amgoud, Florence Dupin de Saint-Cyr