1269 search results - page 139 / 254 » Pi-Calculus in Logical Form |
139
click to vote
UAI
1989
15 years 6 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
158
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
147
click to vote
SYNTHESE
2008
15 years 5 months ago
2008
The present paper offers some remarks on the significance of first order model theory for our understanding of theories, and more generally, for our understanding of the "stru...
158
click to vote
SIAMCOMP
2000
15 years 5 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
169
click to vote
ACL
2009
15 years 3 months ago
2009
We present a new approach to learning a semantic parser (a system that maps natural language sentences into logical form). Unlike previous methods, it exploits an existing syntact...