CADE
2010
Springer
13 years 6 months ago
2010
Springer
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
TAPSOFT
1989
Springer
13 years 8 months ago
1989
Springer
In the 1820's Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set asso...
MM
1997
ACM
13 years 9 months ago
1997
ACM
Constraints can be used to specify declaratively the desired layout of a web document. We present a system architecture in which both the author and the viewer can impose page lay...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
PRDC
2007
IEEE
13 years 11 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
VLSID
2002
IEEE
14 years 5 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...