The Experts below are selected from a list of 4977 Experts worldwide ranked by ideXlab platform
Craig Chambers - One of the best experts on this subject based on the ideXlab platform.
-
ECOOP - Predicate Dispatching: A Unified Theory of Dispatch
ECOOP’98 — Object-Oriented Programming, 1998Co-Authors: Michael D. Ernst, Craig S. Kaplan, Craig ChambersAbstract:Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using Logical Implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism subsumes and extends object-oriented single and multiple dispatch, ML-style pattern matching, predicate classes, and classifiers, which can all be regarded as syntactic sugar for predicate dispatching. This paper introduces predicate dispatching, gives motivating examples, and presents its static and dynamic semantics. An implementation of predicate dispatching is available.
-
Predicate dispatching : A unified theory of dispatch
Lecture Notes in Computer Science, 1998Co-Authors: Michael D. Ernst, Craig S. Kaplan, Craig ChambersAbstract:Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using Logical Implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism subsumes and extends object-oriented single and multiple dispatch, ML-style pattern matching, predicate classes, and classifiers, which can all be regarded as syntactic sugar for predicate dispatching. This paper introduces predicate dispatching, gives motivating examples, and presents its static and dynamic semantics. An implementation of predicate dispatching is available.
Michael D. Ernst - One of the best experts on this subject based on the ideXlab platform.
-
ECOOP - Predicate Dispatching: A Unified Theory of Dispatch
ECOOP’98 — Object-Oriented Programming, 1998Co-Authors: Michael D. Ernst, Craig S. Kaplan, Craig ChambersAbstract:Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using Logical Implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism subsumes and extends object-oriented single and multiple dispatch, ML-style pattern matching, predicate classes, and classifiers, which can all be regarded as syntactic sugar for predicate dispatching. This paper introduces predicate dispatching, gives motivating examples, and presents its static and dynamic semantics. An implementation of predicate dispatching is available.
-
Predicate dispatching : A unified theory of dispatch
Lecture Notes in Computer Science, 1998Co-Authors: Michael D. Ernst, Craig S. Kaplan, Craig ChambersAbstract:Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using Logical Implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism subsumes and extends object-oriented single and multiple dispatch, ML-style pattern matching, predicate classes, and classifiers, which can all be regarded as syntactic sugar for predicate dispatching. This paper introduces predicate dispatching, gives motivating examples, and presents its static and dynamic semantics. An implementation of predicate dispatching is available.
Masao Mukaidono - One of the best experts on this subject based on the ideXlab platform.
-
probabilistic inference and baysian theorem based on Logical Implication
Soft Computing, 1999Co-Authors: Yukari Yamauchi, Masao MukaidonoAbstract:Probabilistic reasoning is an essential approach of approximated reasoning to treat uncertain knowledge. Bayes’ theorem based on the interpretation of a If-Then rule as the conditional probability is widespread in applications of probabilistic reasoning. A new type of Bayes theorem based on the interpretation of a If-Then rule as the Logical Implication is introduced in this paper, where addition and subtraction are employed in the probabilistic operations instead of multiplication and division employed for the conditional probability of the traditional Bayes’ theorem. Inference based on both interpretations of the If-Then rules, conditional probability and Logical Implication, are discussed.
-
RSFDGrC - Probabilistic Inference and Baysian Theorem Based on Logical Implication
Lecture Notes in Computer Science, 1999Co-Authors: Yukari Yamauchi, Masao MukaidonoAbstract:Probabilistic reasoning is an essential approach of approximated reasoning to treat uncertain knowledge. Bayes’ theorem based on the interpretation of a If-Then rule as the conditional probability is widespread in applications of probabilistic reasoning. A new type of Bayes theorem based on the interpretation of a If-Then rule as the Logical Implication is introduced in this paper, where addition and subtraction are employed in the probabilistic operations instead of multiplication and division employed for the conditional probability of the traditional Bayes’ theorem. Inference based on both interpretations of the If-Then rules, conditional probability and Logical Implication, are discussed.
Moshe Y. Vardi - One of the best experts on this subject based on the ideXlab platform.
-
On simplification of schema mappings
Journal of Computer and System Sciences, 2013Co-Authors: Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. VardiAbstract:A schema mapping is a formal specification of the relationship holding between the databases conforming to two given schemas, called source and target, respectively. While in the general case a schema mapping is specified in terms of assertions relating two queries in some given language, various simplified forms of mappings, in particular lav and gav, have been considered, based on desirable properties that these forms enjoy. Recent works propose methods for transforming schema mappings to Logically equivalent ones of a simplified form. In many cases, this transformation is impossible, and one might be interested in finding simplifications based on a weaker notion, namely Logical Implication, rather than equivalence. More precisely, given a schema mapping M, find a simplified (lav, or gav) schema mapping M^' such that M^' Logically implies M. In this paper we formally introduce this problem, and study it in a variety of cases, providing techniques and complexity bounds. The various cases we consider depend on three parameters: the simplified form to achieve (lav, or gav), the type of schema mapping considered (sound, or exact), and the query language used in the schema mapping specification (conjunctive queries and variants over relational databases, or regular path queries and variants over graph databases). Notably, this is the first work on comparing schema mappings for graph databases.
-
linear temporal logic and linear dynamic logic on finite traces
International Joint Conference on Artificial Intelligence, 2013Co-Authors: Giuseppe De Giacomo, Moshe Y. VardiAbstract:In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf. Indeed, we propose a logic, LDLf for Linear Dynamic Logic over finite traces, which borrows the syntax from Propositional Dynamic Logic (PDL), but is interpreted over finite traces. Satisfiability, validity and Logical Implication (as well as model checking) for LTLf. are PSPACE-complete as for LTLf. (and LTL).
-
ICDT - Simplifying schema mappings
Proceedings of the 14th International Conference on Database Theory - ICDT '11, 2011Co-Authors: Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. VardiAbstract:A schema mapping is a formal specification of the relationship holding between the databases conforming to two given schemas, called source and target, respectively. While in the general case a schema mapping is specified in terms of assertions relating two queries in some given language, various simplified forms of mappings, in particular LAV and GAV, have been considered, based on desirable properties that these forms enjoy. Recent works propose methods for transforming schema mappings to Logically equivalent ones of a simplified form. In many cases, this transformation is impossible, and one might be interested in finding simplifications based on a weaker notion, namely Logical Implication, rather than equivalence. More precisely, given a schema mapping M, find a simplified (LAV, or GAV) schema mapping M' such that M' Logically implies M. In this paper we formally introduce this problem, and study it in a variety of cases, providing techniques and complexity bounds. The various cases we consider depend on three parameters: the simplified form to achieve (LAV, or GAV), the type of schema mapping considered (sound, or exact), and the query language used in the schema mapping specification (conjunctive queries and variants over relational databases, or regular path queries and variants over graph databases). Notably, this is the first work on comparing schema mappings for graph databases.
Craig S. Kaplan - One of the best experts on this subject based on the ideXlab platform.
-
ECOOP - Predicate Dispatching: A Unified Theory of Dispatch
ECOOP’98 — Object-Oriented Programming, 1998Co-Authors: Michael D. Ernst, Craig S. Kaplan, Craig ChambersAbstract:Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using Logical Implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism subsumes and extends object-oriented single and multiple dispatch, ML-style pattern matching, predicate classes, and classifiers, which can all be regarded as syntactic sugar for predicate dispatching. This paper introduces predicate dispatching, gives motivating examples, and presents its static and dynamic semantics. An implementation of predicate dispatching is available.
-
Predicate dispatching : A unified theory of dispatch
Lecture Notes in Computer Science, 1998Co-Authors: Michael D. Ernst, Craig S. Kaplan, Craig ChambersAbstract:Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using Logical Implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism subsumes and extends object-oriented single and multiple dispatch, ML-style pattern matching, predicate classes, and classifiers, which can all be regarded as syntactic sugar for predicate dispatching. This paper introduces predicate dispatching, gives motivating examples, and presents its static and dynamic semantics. An implementation of predicate dispatching is available.
