Language equations with complementation: Expressive power
نویسندگان
چکیده
منابع مشابه
On the Expressive Power of the Object Constraint Language OCL
The Object Constraint Language (OCL) has been introduced by IBM for business modelling and adopted by UML as a mean to specify invariants of classes and types in a class model, to specify type invariant of stereotypes, to describe pre-and postconditions on operations and methods, to describe guards, and also as a navigation language. OCL is a language of typed expressions, where an expression c...
متن کاملEnhancing the expressive power of the U-Datalog language
U-Datalog has been developed with the aim of providing a set-oriented logical update language, guaranteeing update parallelism in the context of a Datalog-like language. In U-Datalog, updates are expressed by introducing constraints (+p(X), to denote insertion, and p(X), to denote deletion) inside Datalog rules. A U-Datalog program can be interpreted as a CLP program. In this framework, a set o...
متن کاملThe Expressive Power of the Temporal Query Language Lh
Temporal knowledge representation and reasoning methods require expressive power — which ensures usefulness in non-trivial applications as well as reasonable complexity, which guarantees efficient implementation. The temporal language LH [7, 4, 8, 5] is an attempt to find a balance between expressive power and complexity. LH serves as a means for expressing temporal constraints over the propert...
متن کاملOn the ω-language Expressive Power of Extended Petri Nets
In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with nonblocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well...
متن کاملOn the Expressive Power of the Loop Language
We define a translation of Meyer and Ritchie’s Loop language into a subsystem of Gödel’s system T (with product types). Then we show that this translation actually provides a lock-step simulation if a call-byvalue strategy is assumed for system T. Some generalizations and possible applications are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.10.003