884 search results - page 50 / 177 » A Proof Theory for DL-Lite |
125
click to vote
PEPM
2010
ACM
15 years 1 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Pl¨...
TPHOL
2002
IEEE
15 years 4 months ago
2002
IEEE
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...
108
click to vote
CADE
2005
Springer
16 years 4 days ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...