438 search results - page 66 / 88 » On theorem proving in annotated logics |
151
click to vote
SEMWEB
2007
Springer
16 years 3 days ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
204
click to vote
CSFW
1999
IEEE
15 years 10 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
182
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
143
click to vote
CONTEXT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
176
click to vote
SAC
2010
ACM
15 years 3 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...