Results 1  10
of
4,275
Domain Independence and the Relational Calculus
 Acta Informatica
, 1993
"... Several alternative semantics (or interpretations) of the relational (domain) calculus are studied here. It is shown that they all have the same expressive power, i.e., the selection of any of the semantics neither gains nor loses expressive power. Since the domain is potentially infinite, the answe ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
Several alternative semantics (or interpretations) of the relational (domain) calculus are studied here. It is shown that they all have the same expressive power, i.e., the selection of any of the semantics neither gains nor loses expressive power. Since the domain is potentially infinite
Association Rules in the Relational Calculus
, 2008
"... One of the most utilized data mining tasks is the search for association rules. Association rules represent significant relationships between items in transactions. We extend the concept of association rule to represent a much broader class of associations, which we refer to as entityrelationship r ..."
Abstract
 Add to MetaCart
relationship rules. Semantically, entityrelationship rules express associations between properties of related objects. Syntactically, these rules are based on a broad subclass of safe domain relational calculus queries. We propose a new definition of support and confidence for entityrelationship rules
Safety and translation of relational calculus queries
 ACM Transactions on Database Systems
, 1991
"... Notallqueries inrelational calculus can beanswered sensibly when disjunction, negation, and universal quantification are allowed, The class of relation calculus queries or formulas that have sensible answers is called the domam independent class which is known to be undecidable. Subsequent research ..."
Abstract

Cited by 58 (0 self)
 Add to MetaCart
Notallqueries inrelational calculus can beanswered sensibly when disjunction, negation, and universal quantification are allowed, The class of relation calculus queries or formulas that have sensible answers is called the domam independent class which is known to be undecidable. Subsequent research
List Comprehensions and the Relational Calculus
, 1999
"... Syntax Q = fT N jEg E = E EjE Ej:EjT 2 RjA!Aj9T : R:Ej8T : R:E A = N jBjT [N ] op =! j ? j j j 6= j = 5.3 Semantic Domains T uple = List V al V al = Num+Bool + Unb Unb = T ide X Num Dbase = RIde ! Set T uple Env = T Ide ! T uple 5.4 Semantic Functions 5.4.1 j : Nmls ! V al Not specified 5.4.2 ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Syntax Q = fT N jEg E = E EjE Ej:EjT 2 RjA!Aj9T : R:Ej8T : R:E A = N jBjT [N ] op =! j ? j j j 6= j = 5.3 Semantic Domains T uple = List V al V al = Num+Bool + Unb Unb = T ide X Num Dbase = RIde ! Set T uple Env = T Ide ! T uple 5.4 Semantic Functions 5.4.1 j : Nmls ! V al Not specified 5.4.2 fi : Bools ! V al Not specified 5.4.3 Q : Query ! Dbase ! SetT uple Q[jfT N jEgj] ffi = fae[jT j]j ae 2 E[jEj] ffi fT ! unbtuplegg where unbtuple = null [jT j] j[jN j] 5.4.4 E : Exp ! Dbase ! Env ! Set Env E[jE 0 E 1 j] ffi ae = fae 1 jae 0 2 (E[jE 0 j]ffiae) ae 1 2 (E[jE 1 j]ffiae 0 )g E[jE 0 E 1 j] ffi ae = fae 0 jae 0 2 (E[jE 0 j]ffiae) ae 0 2 (E[jE 1 j]ffiae)g E[j:Ej] ffi ae = f ilter (E[jEj]ffiae) = OE ae E[jT 2 Rj] ffi ae = (unbtuple? ae[jT j] !fae \Phi fT 7! vgj v 2 ffi[jRj]g; f ilter (ae[jT j] 2 ffi[jRj]) ae) E[jA 0 ! A 1 j] ffi ae = \Theta [j!j] (A[jA 0 j]ae) (A[jA 1 j]ae) ae E[j9T : R:Ej] ffi ae = fae 1 jv 2 ffi[jRj] ae 1 2 (E[jEj] ffi ae \Phi fT 7! vg)g E[j8T : R:E...
Intuitionistic Fuzzy Relational Calculus: an Overview
, 2002
"... This paper presents an attempt to embed and unify research on intuitionistic fuzzy (IF) relations into a broad, formal yet intuitive framework inspired by fuzzy relational calculus. The need for the resulting "IF relational calculus" is motivated in semantical terms of vagueness and uncert ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper presents an attempt to embed and unify research on intuitionistic fuzzy (IF) relations into a broad, formal yet intuitive framework inspired by fuzzy relational calculus. The need for the resulting "IF relational calculus" is motivated in semantical terms of vagueness
Featherweight Java: A Minimal Core Calculus for Java and GJ
 ACM Transactions on Programming Languages and Systems
, 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract

Cited by 659 (23 self)
 Add to MetaCart
of the full language (including interfaces and even assignment) to obtain a small calculus, Featherweight Java, for which rigorous proofs are not only possible but easy. Featherweight Java bears a similar relation to Java as the lambdacalculus does to languages such as ML and Haskell. It offers a similar
Relating �calculus to ObjectZ
"... Software systems have become increasingly distributed, dynamic and mobile. The complex state and dynamic interfaces of software components and their concurrent interactions provide challenging research issues in system specification and design. An effective combination of structured statebased form ..."
Abstract
 Add to MetaCart
based formalism and dynamic actionbased calculus may be a good solution for modeling complex distributed mobile systems. In this paper, we investigate the semantic links between ObjectZ and �calculus and consequently introduce a powerful specification technique PiOZ that brings the strengths of the two
A Relational Calculus for . . .
"... This paper discusses a mathematical background for the formal treatment of a number of issues related to software reuse, including: component matching; similarity measures; and component modifications. ..."
Abstract
 Add to MetaCart
This paper discusses a mathematical background for the formal treatment of a number of issues related to software reuse, including: component matching; similarity measures; and component modifications.
Petri Net + Nested Relational Calculus =
"... Abstract. In this paper we propose a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated and the structure of the manipulated data is reflected in the structure of the workflow. It is a common extension of – Petri nets, which are res ..."
Abstract
 Add to MetaCart
are responsible for the organization of the processing tasks, and – Nested relational calculus, which is a database query language over complex objects, and is responsible for handling collections of data items (in particular, for iteration) and for the typing system. We demonstrate that dataflows constructed
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
Results 1  10
of
4,275