134 search results - page 5 / 27 » Natural Deduction Calculus for Computation Tree Logic |
CORR
2000
Springer
13 years 7 months ago
2000
Springer
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...
TABLEAUX
2007
Springer
14 years 1 months ago
2007
Springer
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
SAS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
RTA
1999
Springer
13 years 12 months ago
1999
Springer
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...