939 search results - page 50 / 188 » Semantic Abstraction and Quantum Computation |
108
click to vote
COMMA
2010
14 years 4 months ago
2010
Abstract. This paper presents a technique with which instances of argument structures in the Carneades model can be given a probabilistic semantics by translating them into Bayesia...
ASM
2004
ASM
15 years 3 months ago
2004
ASM
Abstract. Static single assignment (SSA) form is the intermediate representation of choice in modern optimizing compilers for which no formal semantics has been stated yet. To prov...
AGP
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
ICCSA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper a methodology and a framework for personalized views on data available on the World Wide Web are proposed. We describe its main two ingredients, Web data ex...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...