Results 1 
5 of
5
L_0  The First Five Years of an Automated Language Acquisition Project
, 1996
"... The L0 project at ICSI and UC Berkeley attempts to combine not only vision and natural language modelling, but also learning. The original task was put forward in #Feldman et al. 1990a# as a touchstone task for AI and cognitive science. The task is to build a system that can learn the appropriate ..."
Abstract

Cited by 26 (7 self)
 Add to MetaCart
The L0 project at ICSI and UC Berkeley attempts to combine not only vision and natural language modelling, but also learning. The original task was put forward in #Feldman et al. 1990a# as a touchstone task for AI and cognitive science. The task is to build a system that can learn the appropriate fragmentofany natural language from sentencepicture pairs. Wehave not succeeded in building such a system, but wehave made considerable progress on component subtasks and this has led in a number of productive and surprising directions. 1 Introduction The L 0 project at ICSI and UC Berkeley attempts to combine not only vision and natural language modelling, but also learning. The original task was put forward in #Feldman et al. 1990a# as a touchstone task for AI and cognitive science in a very simple form: The system is given examples of pictures paired with true statements about those pictures in an arbitrary natural language. #See Figure 1.# The system is to learn the relevant porti...
Regular Trace Event Structures
, 1996
"... We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting.
What topology tells us about diagnosability in partial order semantics
 In: Proc. 10th Workshop on Discrete Event Systems
, 2010
"... Abstract: From a partial observation of the behaviour of a labeled Discrete Event System, fault Diagnosis strives to determine whether or not a given “invisible ” fault event has occurred. The diagnosability problem can be stated as follows: does the labeling allow for an outside observer to determi ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract: From a partial observation of the behaviour of a labeled Discrete Event System, fault Diagnosis strives to determine whether or not a given “invisible ” fault event has occurred. The diagnosability problem can be stated as follows: does the labeling allow for an outside observer to determine the occurrence of the fault, no later than a bounded number of events after that unobservable occurrence? In concurrent systems, partial order semantics adds to the difficulty of the problem, but also provides a richer and more complex picture of observation and diagnosis. In particular, it is crucial to clarify the intuitive notion of “time after fault occurrence”. To this end, we will use a unifying metric framework for event structures, providing a general topological description of diagnosability in both sequential and nonsequential semantics for Petri nets.
Implicit Programming and the Logic of Constructible Duality
"... ABSTRACT We present an investigation of duality in the traditional logical manner. We extend Nelson's symmetrization of intuitionistic logic, constructible falsity, to a selfdual logic constructible duality. We develop a selfdual model by considering an interval of worlds in an intuitionistic Kr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT We present an investigation of duality in the traditional logical manner. We extend Nelson's symmetrization of intuitionistic logic, constructible falsity, to a selfdual logic constructible duality. We develop a selfdual model by considering an interval of worlds in an intuitionistic Kripke model. The duality arises through how we judge truth and falsity. Truth is judged forward in the Kripke model, as in intuitionistic logic, while falsity is judged backwards. We develop a selfdual algebra such that every point in the algebra is representable by some formula in the logic. This algebra arises as an instantiation of a Heyting algebra into several categorical constructions. In particular, we show that this algebra is an instantiation of the Chu construction applied to a Heyting algebra, the second Dialectica construction applied to a Heyting algebra, and as an algebra for the study of recursion and corecursion. Thus the algebra provides a common base for these constructions, and suggests itself as an important part of any constructive logical treatment of duality. Implicit programming is suggested as a new paradigm for computing with constructible duality as its formal system. We show that all the operators that have computable least fixed points are definable explicitly and all operators with computable optimal fixed points are definable implicitly within constructible duality. Implicit programming adds a novel definitional mechanism that allows functions to be defined implicitly. This new programming feature is especially useful for programming with corecursively defined datatypes such as circular lists. iii DEDICATION To my cousin Jordan Lackey (19631995) whose courage with AIDS was an inspiration. iv
Effective Verification of Weak
"... Abstract: The diagnosability problem can be stated as follows: does a given labeled Discrete Event System allow for an outside observer to determine the occurrence of the “invisible ” fault, no later than a bounded number of events after that unobservable occurrence, and based on the partial observa ..."
Abstract
 Add to MetaCart
Abstract: The diagnosability problem can be stated as follows: does a given labeled Discrete Event System allow for an outside observer to determine the occurrence of the “invisible ” fault, no later than a bounded number of events after that unobservable occurrence, and based on the partial observation of the behaviour? When this problem is investigated in the context of concurrent systems, partial order semantics induces a separation between classical or strong diagnosability on the one hand, and weak diagnosability on the other hand. The present paper presents the first solution for checking weak diagnosability, via a verifier construction.