884 search results - page 60 / 177 » A Proof Theory for DL-Lite |
110
click to vote
KI
1990
Springer
15 years 3 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
100
click to vote
AI
2007
Springer
15 years 6 hour ago
2007
Springer
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
105
click to vote
VLDB
1989
ACM
15 years 3 months ago
1989
ACM
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
BIRTHDAY
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...