History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 750 total

E-unification with constants vs. general E-unification. (English)
J. Autom. Reasoning 48, No. 3, 363-390 (2012).
1
Dealing with satisfiability and n-ary CSPs in a logical framework. (English)
J. Autom. Reasoning 48, No. 3, 391-417 (2012).
2
An instantiation scheme for satisfiability modulo theories. (English)
J. Autom. Reasoning 48, No. 3, 293-362 (2012).
3
SAT modulo linear arithmetic for solving polynomial constraints. (English)
J. Autom. Reasoning 48, No. 1, 107-131 (2012).
4
A decidability result for the model checking of infinite-state systems. (English)
J. Autom. Reasoning 48, No. 1, 1-42 (2012).
5
Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax. (English)
J. Autom. Reasoning 48, No. 1, 43-105 (2012).
6
Decidability and combination results for two notions of knowledge in security protocols. (English)
J. Autom. Reasoning 48, No. 4, 441-487 (2012).
7
The area method. A recapitulation. (English)
J. Autom. Reasoning 48, No. 4, 489-532 (2012).
8
Proof pearl: a formal proof of Dally and Seitz’ necessary and sufficient condition for deadlock-free routing in interconnection networks. (English)
J. Autom. Reasoning 48, No. 4, 419-439 (2012).
9
Unification modulo homomorphic encryption. (English)
J. Autom. Reasoning 48, No. 2, 135-158 (2012).
10
Computing knowledge in security protocols under convergent equational theories. (English)
J. Autom. Reasoning 48, No. 2, 219-262 (2012).
11
Decidability of equivalence of symbolic derivations. (English)
J. Autom. Reasoning 48, No. 2, 263-292 (2012).
12
State and progress in strand spaces: proving fair exchange. (English)
J. Autom. Reasoning 48, No. 2, 159-195 (2012).
13
Reducing equational theories for the decision of static equivalence. (English)
J. Autom. Reasoning 48, No. 2, 197-217 (2012).
14
Classical logic with partial functions. (English)
J. Autom. Reasoning 47, No. 4, 399-425 (2011).
15
Tractable extensions of the description logic ${\mathcal{EL}}$ with numerical datatypes. (English)
J. Autom. Reasoning 47, No. 4, 427-450 (2011).
16
Decreasing diagrams and relative termination. (English)
J. Autom. Reasoning 47, No. 4, 481-501 (2011).
17
Analytic tableaux for higher-order logic with choice. (English)
J. Autom. Reasoning 47, No. 4, 451-479 (2011).
18
Monotonicity inference for higher-order formulas. (English)
J. Autom. Reasoning 47, No. 4, 369-398 (2011).
19
An interpolating sequent calculus for quantifier-free Presburger arithmetic. (English)
J. Autom. Reasoning 47, No. 4, 341-367 (2011).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 750 total