The Experts below are selected from a list of 13374 Experts worldwide ranked by ideXlab platform
Paolo Terenziani - One of the best experts on this subject based on the ideXlab platform.
-
A mathematical framework for the semantics of Symbolic Languages representing periodic time
Annals of Mathematics and Artificial Intelligence, 2006Co-Authors: Lavinia Egidi, Paolo TerenzianiAbstract:In several areas, including Temporal DataBases (TDB), Presburger arithmetic has been chosen as a standard reference for the semantics of Languages representing periodic time, and to study their expressiveness. On the other hand, the proposal of most Symbolic Languages in the AI literature has not been paired with an adequate semantic counterpart, making the task of studying the expressiveness of such Languages and of comparing them a very complex one. In this paper, we first define a representation language which enables us to handle each temporal point as a complex object enriched with all the structure it is immersed in, and then we use it in order to provide a Presburger semantics for classes of Symbolic Languages coping with periodicity. Finally, we use the semantics to compare a few AI and TDB Symbolic approaches.
-
a mathematical framework for the semantics of Symbolic Languages representing periodic time
International Symposium on Temporal Representation and Reasoning, 2004Co-Authors: Lavinia Egidi, Paolo TerenzianiAbstract:In several areas, including temporal databases, Presburger arithmetic has been chosen as a standard reference to express the semantics of Languages representing periodic time, and to study their expressiveness. On the other hand, the proposal of most Symbolic Languages in the AI literature has not been paired with an adequate semantic counterpart, making the task of studying the expressiveness of such Languages and of comparing them a very complex one. In this paper, we first define a representation language which enables us to handle each temporal point as a complex object enriched with all the structure it is immersed in, and then we use it in order to provide a Presburger semantics for classes of Symbolic Languages coping with periodicity.
Lavinia Egidi - One of the best experts on this subject based on the ideXlab platform.
-
A mathematical framework for the semantics of Symbolic Languages representing periodic time
Annals of Mathematics and Artificial Intelligence, 2006Co-Authors: Lavinia Egidi, Paolo TerenzianiAbstract:In several areas, including Temporal DataBases (TDB), Presburger arithmetic has been chosen as a standard reference for the semantics of Languages representing periodic time, and to study their expressiveness. On the other hand, the proposal of most Symbolic Languages in the AI literature has not been paired with an adequate semantic counterpart, making the task of studying the expressiveness of such Languages and of comparing them a very complex one. In this paper, we first define a representation language which enables us to handle each temporal point as a complex object enriched with all the structure it is immersed in, and then we use it in order to provide a Presburger semantics for classes of Symbolic Languages coping with periodicity. Finally, we use the semantics to compare a few AI and TDB Symbolic approaches.
-
a mathematical framework for the semantics of Symbolic Languages representing periodic time
International Symposium on Temporal Representation and Reasoning, 2004Co-Authors: Lavinia Egidi, Paolo TerenzianiAbstract:In several areas, including temporal databases, Presburger arithmetic has been chosen as a standard reference to express the semantics of Languages representing periodic time, and to study their expressiveness. On the other hand, the proposal of most Symbolic Languages in the AI literature has not been paired with an adequate semantic counterpart, making the task of studying the expressiveness of such Languages and of comparing them a very complex one. In this paper, we first define a representation language which enables us to handle each temporal point as a complex object enriched with all the structure it is immersed in, and then we use it in order to provide a Presburger semantics for classes of Symbolic Languages coping with periodicity.
E. Tick - One of the best experts on this subject based on the ideXlab platform.
-
Proceedings of the workshop on Compilation of (Symbolic) Languages for Parallel Computers
1991Co-Authors: I. Foster, E. TickAbstract:This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers, held October 31--November 1, 1991, in San Diego. These unreferred contributions were provided by the participants for the purpose of this workshop; many of them will be published elsewhere in peer-reviewed conferences and publications. Our goal is planning this workshop was to bring together researchers from different disciplines with common problems in compilation. In particular, we wished to encourage interaction between researchers working in compilation of Symbolic Languages and those working on compilation of conventional, imperative Languages. The fundamental problems facing researchers interested in compilation of logic, functional, and procedural programming Languages for parallel computers are essentially the same. However, differences in the basic programming paradigms have led to different communities emphasizing different species of the parallel compilation problem. For example, parallel logic and functional Languages provide dataflow-like formalisms in which control dependencies are unimportant. Hence, a major focus of research in compilation has been on techniques that try to infer when sequential control flow can safely be imposed. Granularity analysis for scheduling is a related problem. The single- assignment property leads to a need for analysis ofmore » memory use in order to detect opportunities for reuse. Much of the work in each of these areas relies on the use of abstract interpretation techniques.« less
-
Proceedings of the Workshop on Compilation of (Symbolic) Languages for Parallel Computers : Held October 31 - November 1, 1991, San Diego, CA
1991Co-Authors: I. Foster, E. TickAbstract:This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers, held October 31 - November 1, 1991, in San Diego. These unrefereed contributions were provided by the participants for the purpose of this workshop; many of them will be published elsewhere in peer-reviewed conferences and publications.
I. Foster - One of the best experts on this subject based on the ideXlab platform.
-
Proceedings of the workshop on Compilation of (Symbolic) Languages for Parallel Computers
1991Co-Authors: I. Foster, E. TickAbstract:This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers, held October 31--November 1, 1991, in San Diego. These unreferred contributions were provided by the participants for the purpose of this workshop; many of them will be published elsewhere in peer-reviewed conferences and publications. Our goal is planning this workshop was to bring together researchers from different disciplines with common problems in compilation. In particular, we wished to encourage interaction between researchers working in compilation of Symbolic Languages and those working on compilation of conventional, imperative Languages. The fundamental problems facing researchers interested in compilation of logic, functional, and procedural programming Languages for parallel computers are essentially the same. However, differences in the basic programming paradigms have led to different communities emphasizing different species of the parallel compilation problem. For example, parallel logic and functional Languages provide dataflow-like formalisms in which control dependencies are unimportant. Hence, a major focus of research in compilation has been on techniques that try to infer when sequential control flow can safely be imposed. Granularity analysis for scheduling is a related problem. The single- assignment property leads to a need for analysis ofmore » memory use in order to detect opportunities for reuse. Much of the work in each of these areas relies on the use of abstract interpretation techniques.« less
-
Proceedings of the Workshop on Compilation of (Symbolic) Languages for Parallel Computers : Held October 31 - November 1, 1991, San Diego, CA
1991Co-Authors: I. Foster, E. TickAbstract:This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers, held October 31 - November 1, 1991, in San Diego. These unrefereed contributions were provided by the participants for the purpose of this workshop; many of them will be published elsewhere in peer-reviewed conferences and publications.
Peter Nyman - One of the best experts on this subject based on the ideXlab platform.
-
QI - A Symbolic Classical Computer Language for Simulation of Quantum Algorithms
Quantum Interaction, 2009Co-Authors: Peter NymanAbstract:Quantum computing is an extremely promising research combining theoretical and experimental quantum physics, mathematics, quantum information theory and computer science. Classical simulation of quantum computations will cover part of the gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. One of the most important problems in "quantum computer science" is the development of new Symbolic Languages for quantum computing and the adaptation of existing Symbolic Languages for classical computing to quantum algorithms. The present paper is devoted to the adaptation of the Mathematica Symbolic language to known quantum algorithms and corresponding simulation on the classical computer. Concretely we shall represent in the Mathematica Symbolic language Simon's algorithm, the Deutsch-Josza algorithm, Grover's algorithm, Shor's algorithm and quantum error-correcting codes. We shall see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the Symbolic language representation of quantum computing and it will be a straightforward matter to include this framework in future algorithms.
