Sciweavers

120 search results - page 17 / 24
» Theorems for Free!
Sort
View
FLOPS
2008
Springer
13 years 9 months ago
Termination of Narrowing in Left-Linear Constructor Systems
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Germán Vidal
DAGSTUHL
2008
13 years 9 months ago
Interval Arithmetic and Standardization
Interval arithmetic is arithmetic for continuous sets. Floating-point intervals are intervals of real numbers with floating-point bounds. Operations for intervals can be efficient...
Jürgen Wolff von Gudenberg
CSL
2002
Springer
13 years 7 months ago
Open Proofs and Open Terms: A Basis for Interactive Logic
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
Herman Geuvers, Gueorgui I. Jojgov
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
IJAC
2006
118views more  IJAC 2006»
13 years 7 months ago
A Correspondence between Balanced Varieties and Inverse Monoids
There is a well-known correspondence between varieties of algebras and fully invariant congruences on the appropriate term algebra. A special class of varieties are those which ar...
Mark V. Lawson