Sciweavers

1448 search results - page 231 / 290
» Restricted Stack Implementations
Sort
View
LPNMR
1993
Springer
13 years 11 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
ECAI
1992
Springer
13 years 11 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
POS
1994
Springer
13 years 11 months ago
Concurrent Shadow Paging in the Flask Architecture
The differing requirements for concurrency models in programming languages and databases are widely diverse and often seemingly incompatible. The rigid provision of a particular c...
David S. Munro, Richard C. H. Connor, Ronald Morri...
PEPM
1992
ACM
13 years 11 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
APPT
2009
Springer
13 years 11 months ago
Dealing with Traffic-Area Trade-Off in Direct Coherence Protocols for Many-Core CMPs
Abstract. In many-core CMP architectures, the cache coherence protocol is a key component since it can add requirements of area and power consumption to the final design and, there...
Alberto Ros, Manuel E. Acacio, José M. Garc...