In this paper we study the relative expressibility of the infinitary *-continuity condition (*-cant) < a * > X ~ V n < a n > x and the equational but weaker induction axiom Ond) X ^ [a*](X =[a lX) --[a*]X in Propositional Dynamic Logic. We show: (1) under ind only, there is a first-order sentence distinguishing separable dynamic algebras from standard Kripke models; whereas (2) under the strong...

Abstract There is a long history presuming smell not expressible in language, but numerous studies recent years challenge this presupposition. Large lexica have been reported around the world thereby showing high lexical codability domain. Psycholinguistic likewise find can be described with relatively agreement, demonstrating efficient . Often two go hand-in-hand: languages also display codabi...

Data flow deeds with nets of concurrently communicating agents. But unlike other theories of concurrency, the main concern here is about the I(nput)-O(u-tput) behavior of a system. The Kahn principle states that for special dctermlnistic agents the Input-Output behavior of a net can bc obtained from the I-O behaviors of its components. The I-O behaviors of Kahn agents are sequential functions a...

XQuery is a powerful XML query language with many features and syntactic constructs. For many common queries we do not need all the expressive power of XQuery. We investigate the effect of omitting certain features of XQuery on the expressive power of the language. We start from a simple base fragment which can be extended by several optional features being aggregation functions such as count a...

In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with the stable model semantics. By using the tool of ultraproducts, a preservation theorem, which asserts that a disjunctive logic program without default negation is bounded with respect to the propos...

It is well-known that neural networks are universal approximators, but that deeper networks tend in practice to be more powerful than shallower ones. We shed light on this by proving that the total number of neuronsm required to approximate natural classes of multivariate polynomials of n variables grows only linearly with n for deep neural networks, but grows exponentially when merely a single...

We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDPs). In particular, we use GSMDPs to more accurately model domains in which planning and execution occur concurrently, planimprovement actions have uncertain effects and duration, and events (such as threats) occur asyn...

We extend broadly studied rewrite transition systems with the mechanism for computing with partial information in the form similar to the one used in concurrent constraint programming. Two new classes of transition systems (fcBPA and fcBPP) are introduced as this extension changes expressibility power of rewrite transition systems corresponding to BPA and BPP. The power of rewrite systems corre...