Sciweavers

767 search results - page 84 / 154
» Logic for Mathematical Writing
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
SAC
2006
ACM
14 years 1 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
Sylvie Boldo, César Muñoz
ICAIL
2005
ACM
14 years 1 months ago
Computational Law
Computational law is an approach to automated legal reasoning focusing on semantically rich laws, regulations, contract terms, and business rules in the context of electronicallym...
Nathaniel Love, Michael R. Genesereth
CALCO
2005
Springer
85views Mathematics» more  CALCO 2005»
14 years 1 months ago
Using Proofs by Coinduction to Find "Traditional" Proofs
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
Clemens Grabmayer
ERSHOV
2001
Springer
14 years 5 days ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema