838 search results - page 6 / 168 » From Natural Language to Formal Proof Goal |
AUSAI
1998
Springer
13 years 11 months ago
1998
Springer
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...
TCC
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
ACL
1989
13 years 8 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...