4401 search results - page 224 / 881 » Computing with Default Logic |
151
click to vote
CADE
2008
Springer
15 years 7 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
135
click to vote
ACL
1998
15 years 6 months ago
1998
The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the...
128
click to vote
CIE
2008
Springer
15 years 5 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
167
click to vote
LFCS
2007
Springer
15 years 11 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
121
click to vote
ARITH
1999
IEEE
15 years 9 months ago
1999
IEEE
A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm i...