Results 1  10
of
29
Operators and Laws for Combining Preference Relations
, 2002
"... The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator maps a family of relations to a single relation which represents their lexicographic combination according to a certain pri ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator maps a family of relations to a single relation which represents their lexicographic combination according to a certain priority on the family of relations. We present four kinds of results. We show
Correspondence between Operational and Denotational Semantics
 Handbook of Logic in Computer Science
, 1995
"... This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational semantics of PCF induced by an interpretation; (standard) Scott model, adequacy, weak adequacy and its proof (by a computability predicate) Domain Theory up to SFP and Scott domains; non full abstraction of the standard model, definability of compact elements and full abstraction for PCFP (PCF + parallel or), properties of orderextensional (continuous) models of PCF, Milner's model and Mulmuley's construction (excluding proofs) Additional topics (time permitting): results on pure simplytyped lambda calculus, Friedman 's Completeness Theorem, minimal model, logical relations and definability, undecidability of lambda definability (excluding proof), dIdomains and stable functions Homepa...
Transformations between Signed and Classical Clause Logic
 In Proc. 29th International Symposium on MultipleValued Logics (ISMVL’99
, 1999
"... . In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming, which can be embedded into the first. The underlying basic idea is to generalize the classical notion of a literal by ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
. In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming, which can be embedded into the first. The underlying basic idea is to generalize the classical notion of a literal by adorning an atomic formula with a sign or label which in general consists of a possibly ordered set of truth values. In this paper we relate signed logic and classical logic more closely than before by defining two new transformations between them. As a byproduct we obtain a number of new complexity results and proof procedures for signed logics. 1 Introduction In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: from generic treatments of manyvalued logic, socalled signed logic emerged (see, for example, [7, 8, 4, 5, 15, 16]) while annotated logic programming (see, for example, [13, 9, 10]) was motivated b...
Type Elaboration and Subtype Completion for Java Bytecode
 IN PROCEEDINGS 27TH ACM SIGPLANSIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 1999
"... Java source code is strongly typed, but the translation from Java source to bytecode omits much of the type information originally contained within methods. Type elaboration is a technique for reconstructing strongly typed programs from incompletely typed bytecode by inferring types for local variab ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Java source code is strongly typed, but the translation from Java source to bytecode omits much of the type information originally contained within methods. Type elaboration is a technique for reconstructing strongly typed programs from incompletely typed bytecode by inferring types for local variables. There are situations where, technically, there are not enough types in the original type hierarchy to type a bytecode program. Subtype completion is a technique for adding necessary types to an arbitrary type hierarchy to make type elaboration possible for all verifiable Java bytecode. Type elaboration with subtype completion has been implemented as part of the Marmot Java compiler.
Scalability In Formal Concept Analysis
 Computational Intelligence
, 1999
"... This paper presents the results of experiments carried out with a set of 4,000 medical discharge summaries in which were recognised 1,962 attributes from the Unified Medical Language System (UMLS). In this domain, the objects are medical documents (4,000) and the attributes are UMLS terms extracted ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
This paper presents the results of experiments carried out with a set of 4,000 medical discharge summaries in which were recognised 1,962 attributes from the Unified Medical Language System (UMLS). In this domain, the objects are medical documents (4,000) and the attributes are UMLS terms extracted from the documents (1,962). When Formal Concept Analysis is used to iteratively analyse and visualize this data, complexity and scalability become critically important. Although the amount of data used in this experiment is small compared with the size of primary memory in modern computers, the results are still important since the probability distributions which determine the efficiencies are likely to remain stable as the size of the data is increased. Our work presents two outcomes, firstly we present a methodology for exploring knowledge in text documents using Formal Concept Analysis by employing conceptual scales created as the result of direct manipulation of a line diagram. The conceptual scales lead to small derived purified contexts that are represented using nested line diagrams. Secondly, we present an algorithm for the fast determination of purified contexts from a compressed representation of the large formal context. Our work draws on existing encoding and compression techniques to show how rudimentary data analysis can lead to substantial efficiency improvements to knowledge visualisation. c fl 1993 Blackwell Publishers, 238 Main Street, Cambridge, MA 02142, USA, and 108 Cowley Road, Oxford, OX4 1JF, UK. SCALABILITY IN FORMAL CONCEPT ANALYSIS 3
Expressivity properties of Boolean BI through Relational Models
 In 26th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, LNCS 4337
, 2006
"... ..."
Galois connections and fixed point calculus
 In Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
, 2002
"... Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed point calculus together with a number of applications of direct relevance to the construction of computer programs. The tut ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed point calculus together with a number of applications of direct relevance to the construction of computer programs. The tutorial also presents the theory and application of Galois connections between partially ordered sets. In particular, the intimate relation between Galois connections and ˛xed point equations
Quantales as completions of ordered monoids: Revised semantics for Intuitionistic Linear Logic
 Electronic Notes in Theoretical Computer Science
, 2000
"... The aim of this paper is to propose a unified analysis of the relationships between the notions of order and closure and to relate it to different semantics of Intuitionistic Linear Logic (ILL). We study the embedding of ordered monoids into quantales and then we propose general constructions and re ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
The aim of this paper is to propose a unified analysis of the relationships between the notions of order and closure and to relate it to different semantics of Intuitionistic Linear Logic (ILL). We study the embedding of ordered monoids into quantales and then we propose general constructions and results about such an embedding. Therefore we obtain a new semantics based on ordered monoids and also new completeness results for ILL.
Posets for Configurations!
 of LNCS
, 1992
"... . We define families of posets, ordered by prefixes, as the counterpart of the usual families of configurations ordered by subsets. On these objects we define two types of morphism: event and order morphisms, resulting in categories FPos and FPos v . We then show the following:  Families of pos ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
. We define families of posets, ordered by prefixes, as the counterpart of the usual families of configurations ordered by subsets. On these objects we define two types of morphism: event and order morphisms, resulting in categories FPos and FPos v . We then show the following:  Families of posets, in contrast to families of configurations, are always prime algebraic; in fact the category FPos v is equivalent to the category of prime algebraic domains;  On the level of events, FPos is equivalent to the category of prime algebraic domains with an additional relation encoding event identity.  The (abstract) event identity relation can be used to characterize concrete relations between events such as binary conflict and causal flow;  One can characterize a wide range of eventbased models existing in the literature as families of posets satisfying certain specific structural conditions formulated in terms of event identity. In: CONCUR '92, W.R. Cleaveland (Ed.), Lecture N...
Fortuna: Model Checking Priced Probabilistic Timed Automata
"... We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of realtime, probabilistic and cost features. This is required for addressing key design tradeoffs that arise in many practical applications such as the Zeroconf ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of realtime, probabilistic and cost features. This is required for addressing key design tradeoffs that arise in many practical applications such as the Zeroconf, Bluetooth, IEEE802.11 and Firewire protocols, protocols for sensor networks, and scheduling problems with failures. PPTAs are an extension of probabilistic timed automata (PTAs) with costrates and discrete cost increments on states. Fortuna is able to compute the maximal probability by which a state can be reached under a certain costbound (and timebound). Although this problem is undecidable in general, there exists a semialgorithm that produces a nondecreasing sequence of probabilities converging to the maximum. This paper presents a number of crucial optimizations of that algorithm. We compare the performance of Fortuna with existing approaches for PTAs. Surprisingly, although PPTAs are more general, our techniques exhibit superior performance.