Sciweavers

1699 search results - page 272 / 340
» On the Expressive Power of QLTL
Sort
View
TAPSOFT
1997
Springer
15 years 10 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez
TIME
1994
IEEE
15 years 10 months ago
Belief Revision in a Discrete Temporal Probability-Logic
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
Scott D. Goodwin, Howard J. Hamilton, Eric Neufeld...
BTW
1993
Springer
193views Database» more  BTW 1993»
15 years 10 months ago
Query Optimization in an OODBMS
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
Christian Rich, Marc H. Scholl
ALP
1992
Springer
15 years 10 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
ECOOP
1992
Springer
15 years 10 months ago
Object-Oriented Multi-Methods in Cecil
Multiple dispatching provides increased expressive power over single dispatching by guiding method lookup using the values of all arguments instead of only the receiver. However, ...
Craig Chambers