884 search results - page 98 / 177 » A Proof Theory for DL-Lite |
111
click to vote
IPL
2007
14 years 11 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
103
click to vote
ASE
2002
14 years 11 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
102
click to vote
IANDC
2010
14 years 10 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
POPL
2012
ACM
13 years 7 months ago
2012
ACM
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
ENTCS
2008
14 years 12 months ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...