Results 1  10
of
297
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
the modern (complexity theoretic) formulation of the Church–Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a boundederror probabilistic Turing machine, and thus not in the class
Temporal Reasoning in the Situation Calculus
, 1994
"... A fundamental problem in Knowledge Representation is the design of a logical language to express theories about actions and change. One of the most prominent proposals for such a language is John McCarthy's situation calculus, a formalism which views situations as branching towards the future. ..."
Abstract

Cited by 137 (11 self)
 Add to MetaCart
A fundamental problem in Knowledge Representation is the design of a logical language to express theories about actions and change. One of the most prominent proposals for such a language is John McCarthy's situation calculus, a formalism which views situations as branching towards the future
Pattern Matching Using Automata
, 2000
"... The problem that this article is dealing with is that of Pattern Matching. We are seeking for an effcient algorithm that, given a pattern and a string of characters, will determine whether the string matches the pattern or not. In our quest we are going to encounter elements from the theory of regul ..."
Abstract
 Add to MetaCart
of regular languages and automata. We begin by presenting regular expressions and the three operations associated with them. Then we built the appropriate formal frame for classic automata, which will lead us directly to a first solution to the pattern matching problem. Unfortunately this solution has
IN FORMAL THEORY
"... Within software’s life cycle, program testing is very important, since quality of specification demand, design and application must be proven. All definitions related to program testing are based on the same tendency and that is to give answer to the question: does the program behave in the requeste ..."
Abstract
 Add to MetaCart
sequence, and this translation may be automated. Method comprises of transformation part and resolution part.This work gives the description of the general frame for the investigation of the problem regarding program correctness, using the method of resolution invalidation.. It is shown how the rules
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
transformation in employment patterns concerns the development of exible work, as the predominant form of working arrangements. Parttime work, temporar y work, selfemployment, work by contract, informal or semiformal labour arrangements, and Materials for an exploratory theory of the network society 11
An automata theoretic approach to the theory of rational tree relations
, 2008
"... Abstract. We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions by Raoult (Bull. Belg. Math. Soc. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. Th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. The automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness problem). The second contribution of this paper is a new subclass of the rational tree relations, called separaterational tree relations, defined via a natural restriction on asynchronous tree automata
Probabilistic inference . . .
"... We present SGDPLL(T), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter (currently, equalities and inequalities on discrete sorts). While many solution ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
solutions to probabilistic inference over logic representations have been proposed, SGDPLL(T) is simultaneously (1) lifted, (2) exact and (3) modulo theories, that is, parameterized by a background logic theory. This offers a foundation for extending it to rich logic languages such as data structures
The Qualification Problem: A solution to the problem of anomalous models
 Artificial Intelligence
"... Abstract. Intelligent agents in open environments inevitably face the Quali¯cation Problem: The executability of an action can never be predicted with absolute certainty; unexpected circumstances, albeit unlikely, may at any time prevent the successful performance of an action. Reasoning agents in ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
, and they are avoided by appealing to just this concept. Our theory builds on the established predicate logic formalism of the Fluent Calculus as a solution to the Frame Problem and to the Rami¯cation Problem in reasoning about actions. The monotonic Fluent Calculus is enhanced by a default theory in order to obtain
Fair Control Of omegaAutomata
, 2000
"... Given a Rabin automaton, we consider the problem of computing the fair controllability subset of states, which consists of those states from which the automaton can be guided by a 'fair' controller to meet the acceptance condition of the automaton. The problem is investigated with respect ..."
Abstract
 Add to MetaCart
notions. A matching PTIMEhardness result is also shown. 1. INTRODUCTION The study of control theory in discrete event dynamic systems [3] has beneted a great deal from the knowledge of automata theory and formal languages. Among problems of interest regarding the innite behaviors of discrete event
Distributing Automata for Asynchronous Networks of Processors
 European Journal on Automated Systems
, 1994
"... : This paper addresses the problem of distributed program synthesis. In the first part, we formalize the distribution process and prove its correctness, i.e. that the initial centralized program's behavior is equivalent to the corresponding distributed's one. In order to achieve that, we f ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
coding for an action and its dependencies with other actions. In the second part, we show how such an orderautomaton can be practically used to derive a distributed program. Keywords: theory of parallel and distributed computation, automata and formal languages (R'esum'e : tsvp) This work
Results 1  10
of
297