Sciweavers

1546 search results - page 202 / 310
» Context-Aware Computing with Sound
Sort
View
TABLEAUX
1999
Springer
15 years 10 months ago
Merge Path Improvements for Minimal Model Hyper Tableaux
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
Peter Baumgartner, Joseph Douglas Horton, Bruce Sp...
KR
1998
Springer
15 years 10 months ago
Using an Expressive Description Logic: FaCT or Fiction?
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
Ian Horrocks
LICS
1997
IEEE
15 years 10 months ago
Full Abstraction for Functional Languages with Control
traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...
James Laird
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
15 years 10 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
AISC
1994
Springer
15 years 10 months ago
Using Commutativity Properties for Controlling Coercions
This paper investigates some soundness conditions which have to be fulfilled in systems with coercions and generic operators. A result of Reynolds on unrestricted generic operators...
Stephan A. Missura, Andreas Weber