884 search results - page 58 / 177 » A Proof Theory for DL-Lite |
124
click to vote
ELP
1991
15 years 3 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
CADE
2003
Springer
16 years 5 days ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
FASE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Coalgebra has in recent years been recognized as the framework of choice for the treatment of reactive systems at an appropriate level of generality. Proofs about the rea...
BIRTHDAY
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We propose to use Grothendieck institutions based on 2categorical diagrams as a basis for heterogeneous specification. We prove a number of results about colimits and (so...