We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about uents, events and temporal constraints. Although the complete inference algorithm is exponential, we characterize a tractable core with limited expressibility and inferential power. Our results render a variety of constraint propagation techniques appl...

My early research was inspired by the mathematical semantics of Scott and Strachey. Two such topics, recounted in this paper, were the fixed-point analysis of pointer loops and the expressibility of a style of functional programming introduced by Barron and Strachey.

In this paper we describe some of our progress towards an operational implementation of a modern programming logic. The logic is inspired by the variable type systems of Feferman, and is designed for reasoning about imperative functional programs. The logic goes well beyond traditional programming logics, such as Hoare’s logic and Dynamic logic in its expressibility, yet is less problematic to ...

Though data-parallelism addresses a wide variety of problems in scientiic computing, this model in inadequate for general adaptive applications. Coir is our object-oriented thread-based model for data and task parallelism 25, 22, 24]. In this paper we brieey discuss the Coir objects-thread objects for control-parallelism and groups of thread objects, called ropes, for data-parallelism. Using an...

As a mainstream approach in the quantum machine learning field, variational algorithms (VQAs) are frequently mentioned among most promising applications for computing. However, VQAs suffer from inefficient training methods. Here, we propose pretraining strategy named near Clifford circuits warm start (NCC-WS) to find initialization parameterized (PQCs) VQAs. We explored expressibility of NCCs a...

The ultimate goal in machine learning is to construct a model function that has generalization capability for unseen dataset, based on given training dataset. If the too much expressibility power, then it may overfit data and as result lose capability. To avoid such overfitting issue, several techniques have been developed classical regime, dropout one effective method. This paper proposes stra...

Let $$f_1(n), \ldots , f_k(n)$$ be polynomial functions of n. For fixed $$n\in \mathbb {N}$$ let $$S_n\subseteq the numerical semigroup generated by $$f_1(n),\ldots ,f_k(n)$$ . As n varies, we show that many invariants $$S_n$$ are eventually quasi-polynomial in n, most notably Betti numbers, but also type, genus, and size $$\Delta $$ -set. The tool use is expressibility logical system parametri...

We describe ongoing work on the definition of a UML-based development methodology for the software of embedded systems. The aim is to improve current tools and methods by incorporating formal techniques. As a starting point, we define a formal semantics for a selected subset of UML. Next this language is extended to increase expressibility, especially concerning timing. Keywords— UML, embedded ...

This paper addresses the opportunities for, and eeects of, incorporating object attributes in Linda-like tuple-space systems. The focus is on exploring how the coordination attributes are aaected by this enhancement, and investigating in what ways the classical Linda model needs to be modiied. Particular emphasis is placed on the potential practical gains to be expected in both performance and ...

We develop a methodology for comparing knowledge representation formalisms in terms of their \representational succinctness," that is, their ability to express knowledge situations relatively eeciently. We use this framework for comparing many important formalisms for knowledge base representation: propositional logic, default logic, circumscription, and model preference defaults; and, at a low...