5084 search results - page 29 / 1017 » Proving Possibility Properties |
CP
2003
Springer
14 years 3 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
ICLP
2004
Springer
14 years 3 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
IJAC
2007
13 years 9 months ago
2007
In this paper we consider Property (FA) for lattices in SU(2, 1). First, we prove that SU(2, 1; O3) has Property (FA). We then prove that the arithmetic lattices in SU(2, 1) of se...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we formulate and prove a statistical version of the Cand
TPHOL
1999
IEEE
14 years 2 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...