247 search results - page 16 / 50 » A Computational Structure for the Propositional Calculus |
ILP
1998
Springer
13 years 11 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
IS
2008
13 years 7 months ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
WOLLIC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Bulk Synchronous Parallel ML (BSML) is an extension of the functional language Objective Caml to program Bulk Synchronous Parallel (BSP) algorithms. It is deterministic, deadlock ...