634 search results - page 42 / 127 » Completion Procedures as Semidecision Procedures |
107
Voted
PLDI
1992
ACM
15 years 7 months ago
1992
ACM
: SELF's debugging system provides complete source-level debugging (expected behavior) with globally optimized code. It shields the debugger from optimizations performed by th...
135
click to vote
DLOG
2007
15 years 5 months ago
2007
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
129
click to vote
APN
2010
Springer
15 years 3 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
114
click to vote
TPLP
2008
15 years 3 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
208
click to vote
ICDE
1997
IEEE
16 years 4 months ago
1997
IEEE
We demonstrate the use of a hyper-programming system in building persistent applications. This allows program representations to contain type-safe links to persistent objects embe...