634 search results - page 42 / 127 » Completion Procedures as Semidecision Procedures |
PLDI
1992
ACM
15 years 1 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...
DLOG
2007
15 years 2 days 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...
APN
2010
Springer
14 years 10 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...
TPLP
2008
14 years 9 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 ...
152
click to vote
ICDE
1997
IEEE
15 years 11 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...