Sciweavers

2911 search results - page 181 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
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
RTA
1993
Springer
15 years 10 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
Jordi Levy, Jaume Agustí-Cullell
FOSSACS
2000
Springer
15 years 10 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
PODS
2010
ACM
159views Database» more  PODS 2010»
15 years 8 months ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo
EACL
1993
ACL Anthology
15 years 7 months ago
Mathematical Aspects of Command Relations
In gb, the importance of phrase-structure rules has dwindled in favour of nearness conditions. Today, nearness conditions play a major role in defining the correct linguistic rep...
Marcus Kracht