1269 search results - page 133 / 254 » Pi-Calculus in Logical Form |
121
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
159
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
127
click to vote
CADE
2001
Springer
16 years 5 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
195
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
Fuzzy logic has been used yet for extending database models to deal with vagueness in the definitions of linguistic concepts as "tall" or "long". However, the ...
153
Voted
PERCOM
2006
ACM
16 years 5 months ago
2006
ACM
In this paper we present an integrated view for modeling and reasoning for context applications using OWL DL. In our case study, we describe a task driven approach to model typica...