In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axioms and unique name axioms. This kind of treatment is very important since this enable to apply various technique developed in operations research to nonmonotonic reasoning. (Nerode et al., 1995) are the first to propose...

Probabilistic finite state machines have recently emerged as a viable tool for modelling and analysis of complex non-linear dynamical systems. This paper rigorously establishes such models as finite encodings of probability measure spaces defined over symbol strings. The well known Nerode equivalence relation is generalized in the probabilistic setting and pertinent results on existence and uni...

Let L ◦ be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality ◦, understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language L ◦ by interpreting L ◦ in dynamic topological systems, i.e., ordered pairs 〈X, f 〉, where X is a topological space and f is a continuous function on X ...

Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language L by interpreting L in dynamic topological systems, i.e. ordered pairs 〈X, f 〉, where X is a topological space and f is a continuous function on X. Artemov...

We present a novel canonical automaton model, based on register automata, that can be used to specify protocol or program behavior. Register automata have a finite control structure and a finite number of registers (variables), and process sequences of terms that carry data values from an infinite domain. We consider register automata that compare data values for equality. A major contribution ...

in this paper, a fuzzy version of the analytic form of hahn-banachextension theorem is given. as application, the hahn-banach theorem for$r$-fuzzy bounded linear functionals on $r$-fuzzy normedlinear spaces is obtained.

In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...

The proposed theorem in this paper is indicative of a kind of duality in the propagation of waves in the dual media of and in the spherical structures. Independent of wave frequency, the number of layers, their thickness, and the type of polarization, this theorem holds true in case of any change in any of these conditions. Theorem: Consider a plane wave incident on a multilayered spheric...

In this workwe shall consider a notion of complexity of formal languages L that is inspired by the concept of entropy from dynamical systems. More precisely, we shall define the topological entropy of L to be the exponential growth-rate of the restrictions of the Nerode congruence relation of L to words of length at most n. We shall show that the topological entropy of regular languages is alwa...