1128 search results - page 37 / 226 » Classical Natural Deduction |
JAR
2002
13 years 9 months ago
2002
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
NAACL
2007
13 years 11 months ago
2007
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
BIRTHDAY
2003
Springer
14 years 3 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...
CAV
1993
Springer
14 years 2 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...