681 search results - page 76 / 137 » Parsing as Natural Deduction |
169
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
156
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
162
click to vote
CAV
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
162
click to vote
CL
2000
Springer
15 years 9 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
145
click to vote
DLOG
2007
15 years 8 months ago
2007
One of the main concerns of constructive semantics is to provide a computational interpretation for the proofs of a given logic. In this paper we introduce a constructive semantics...