884 search results - page 74 / 177 » A Proof Theory for DL-Lite |
162
click to vote
TACAS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
163
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
149
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
151
click to vote
CCL
1994
Springer
15 years 10 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
182
click to vote
STOC
1989
ACM
15 years 10 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...