Results 1  10
of
26
Demanddriven Computation of Interprocedural Data Flow
, 1995
"... This paper presents a general framework for deriving demanddriven algorithms for interprocedural data flow analysis of imperative programs. The goal of demanddriven analysis is to reduce the time and/or space overhead of conventional exhaustive analysis by avoiding the collection of information tha ..."
Abstract

Cited by 77 (9 self)
 Add to MetaCart
This paper presents a general framework for deriving demanddriven algorithms for interprocedural data flow analysis of imperative programs. The goal of demanddriven analysis is to reduce the time and/or space overhead of conventional exhaustive analysis by avoiding the collection of information that is not needed. In our framework, a demand for data flow information is modeled as a set of data flow queries. The derived demanddriven algorithms find responses to these queries through a partial reversal of the respective data flow analysis. Depending on whether minimizing time or space is of primary concern, result caching may be incorporated in the derived algorithm. Our framework is applicable to interprocedural data flow problems with a finite domain set. If the problem's flow functions are distributive, the derived demand algorithms provide as precise information as the corresponding exhaustive analysis. For problems with monotone but nondistributive flow functions the provided dat...
Event structure semantics for CCS and related languages
 Computer Science Department, Aarhus University
, 1982
"... rIJ ..."
Concrete Domains
 Theoretical Computer Science
, 1993
"... This paper introduces the theory of a particular kind of computation domains called concrete domains. The purpose of this theory is to find a satisfactory framework for the notions of coroutine computation and sequentiality of evaluation. Diagrams are emphasized because I believe that an important ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
This paper introduces the theory of a particular kind of computation domains called concrete domains. The purpose of this theory is to find a satisfactory framework for the notions of coroutine computation and sequentiality of evaluation. Diagrams are emphasized because I believe that an important part of learning lattice theory is the acquisition of skill in drawing diagrams. George Gratzer 1 Domains of computation In general, we follow Scott's approach [Sco70]. To every syntactic object one associates a semantic object which is found in an appropriate semantic domain. For technical details, we follow [Mil73] and [Plo78] rather than Scott. Definition 1.1 A partial order is a pair ! D; ? where D is a nonempty set and is a binary relation satisfying: i) 8x 2 D x x (reflexivity) ii) 8x; y 2 D x y; y x ) x = y (antisymmetry) iii) 8x; y; z 2 D x y; y z ) x z (transitivity) One writes x ! y when x y and x 6= y. Two elements x and y are comparable when either x y or y x. W...
Fixpoint Iteration with Subsumption in Deductive Databases
, 1995
"... Declarative languages for deductive and objectoriented databases require some highlevel mechanism for specifying semantic control knowledge. This paper proposes usersupplied subsumption information as a paradigm to specify desired, prefered or useful deductions at the meta level. For this purpose ..."
Abstract

Cited by 22 (9 self)
 Add to MetaCart
Declarative languages for deductive and objectoriented databases require some highlevel mechanism for specifying semantic control knowledge. This paper proposes usersupplied subsumption information as a paradigm to specify desired, prefered or useful deductions at the meta level. For this purpose we augment logic programming by subsumption relations and succeed to extend the classical theorems for least models, fixpoints and bottomup evaluation accordingly. Moreover, we provide a differential fixpoint operator for efficient query evaluation in deductive databases. This operator discards subsumed tuples on the fly. We also exemplify the ease of use of this programming methodology. In particular, we demonstrate how heuristic AI search procedures can be integrated into deductive databases in this way.
A RelationAlgebraic Approach to the Region Connection Calculus
 Fundamenta Informaticae
, 2001
"... We explore the relationalgebraic aspects of the region connection calculus (RCC) of Randell et al. (1992a). In particular, we present a refinement of the RCC8 table which shows that the axioms provide for more relations than are listed in the present table. We also show that each RCC model leads ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
We explore the relationalgebraic aspects of the region connection calculus (RCC) of Randell et al. (1992a). In particular, we present a refinement of the RCC8 table which shows that the axioms provide for more relations than are listed in the present table. We also show that each RCC model leads to a Boolean algebra. Finally, we prove that a refined version of the RCC5 table has as models all atomless Boolean algebras B with the natural ordering as the "part  of" relation, and that the table is closed under first order definable relations iff B is homogeneous. 1 Introduction Qualitative reasoning (QR) has its origins in the exploration of properties of physical systems when numerical information is not sufficient  or not present  to explain the situation at hand (Weld and Kleer, 1990). Furthermore, it is a tool to represent the abstractions of researchers who are constructing numerical systems which model the physical world. Thus, it fills a gap in data modeling which often l...
Building concept (Galois) lattices from parts: Generalizing the incremental methods
 Proceedings of the ICCS’01
, 2001
"... Formal concept analysis and Galois lattices in general are increasingly used as a framework for the resolution of practical problems from software engineering, knowledge engineering and data mining. Recent applications have put the emphasis on the need for both efficient, scalable and flexible al ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
Formal concept analysis and Galois lattices in general are increasingly used as a framework for the resolution of practical problems from software engineering, knowledge engineering and data mining. Recent applications have put the emphasis on the need for both efficient, scalable and flexible algorithms to build the lattice. Such features are sought in the development of incremental algorithms. However, the major known incremental algorithm lacks clear theoretical foundations and shows some design flaws which strongly affect its practical performances. Our paper presents a general theoretical framework for the assembly of lattices sharing a same set of attributes based on existing theory on subposition of contexts. The framework underlies the design of a generic procedure for lattice assembly from parts, a new lattice building approach which is more general than the existing incremental and batch ones. As an argument for its theoretical strength, we describe the way our procedure reduces to an improved version of the major known incremental algorithm, which both corrects existing bugs and increases its overall efficiency.
A PartitionBased Approach towards Constructing Galois (Concept) Lattices
 Discrete Mathematics
, 2002
"... Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both efficient and fle ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both efficient and flexible algorithms to construct the lattice. Our paper presents a novel approach for lattice construction based on the apposition of binary relation fragments. We extend the existing theory to a complete characterization of the global Galois (concept) lattice as a substructure of the direct product of the lattices related to fragments. The structural properties underlie a procedure for extracting the global lattice from the direct product, which is the basis for a fullscale lattice construction algorithm implementing a divideandconquer strategy. The paper provides a complexity analysis of the algorithm together with some results about its practical performance and describes a class of binary relations for which the algorithm outperforms the most efficient latticeconstructing methods.
Logical Reasoning in Natural Language: It Is All about Knowledge
, 1993
"... A formal, computational, semantically clean representation of natural language is presented. This representation captures the fact that logical inferences in natural language crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
A formal, computational, semantically clean representation of natural language is presented. This representation captures the fact that logical inferences in natural language crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, adverb, preposition, and verb phrases. The representation parallels natural language in that it accounts for human intuition about entailment of sentences, it preserves its structure, it reflects the semantics of different syntactic categories, it simulates conjunction, disjunction, and negation in natural language by computable operations with provable mathematical properties, and it allows one to represent coordination on different syntactic levels. The representation demonstrates that Boolean semantics of natural language can be successfully modeled in terms of representation and inference by knowledge representation formalisms with Boolean semantics. A novel approach to the problem of au...
Quantum Domain Theory  Definitions and Applications
 Proceedings of CCA’03
, 2003
"... Domain theory is a branch of classical computer science. It has proven to be a rigourous mathematical structure to describe denotational semantics for programming languages and to study the computability of partial functions. In this paper, we study the extension of domain theory to the quantum sett ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Domain theory is a branch of classical computer science. It has proven to be a rigourous mathematical structure to describe denotational semantics for programming languages and to study the computability of partial functions. In this paper, we study the extension of domain theory to the quantum setting. By defining a quantum domain we introduce a rigourous definition of quantum computability for quantum states and operators. Furthermore we show that the denotational semantics of quantum computation has the same structure as the denotational semantics of classical probabilistic computation introduced by Kozen [23]. Finally, we briefly review a recent result on the application of quantum domain theory to quantum information processing. 1
A maxplus finite element method for solving finite horizon deterministic optimal control problems
 in "Proceedings of MTNS’04, Louvain, Belgique", Also arXiv:math.OC/0404184, 2004, http://hal.inria.fr/inria00071426. Maxplus 31
"... Abstract. We introduce a maxplus analogue of the PetrovGalerkin finite element method, to solve finite horizon deterministic optimal control problems. The method relies on a maxplus variational formulation, and exploits the properties of projectors on maxplus semimodules. We obtain a nonlinear d ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We introduce a maxplus analogue of the PetrovGalerkin finite element method, to solve finite horizon deterministic optimal control problems. The method relies on a maxplus variational formulation, and exploits the properties of projectors on maxplus semimodules. We obtain a nonlinear discretized semigroup, corresponding to a zerosum two players game. We give an error estimate of order √ ∆t + ∆x(∆t) −1, for a subclass of problems in dimension 1. We compare our method with a maxplus based discretization method previously introduced by Fleming and McEneaney.