Results 1  10
of
31
Parallel Multiple ContextFree Grammars, FiniteState Translation Systems, And PolynomialTime Recognizable Subclasses Of LexicalFunctional Grammars
 IN 31ST MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL'93
, 1993
"... A number of grammatical formalisms were introduced to define the syntax of natural languages. Among them are parallel multiple contextfree grammars (pmcfg's) and lexicalfunctional grammars (lfg's). Pmcfg's and their subclass called multiple contextfree grammars (mcfg's) are na ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
's) are natural extensions of cfg's, and pmcfg's are known to be recognizable in polynomial time. Some subclasses of lfg's have been proposed, but they were shown to generate an A/'7complete language. Finite state translation systems (fts') were intro duced as a computational model
The Serializability of Concurrent Database Updates
 Journal of the ACM
, 1979
"... ABSTRACT A sequence of interleaved user transactions in a database system may not be ser:ahzable, t e, equivalent to some sequential execution of the individual transactions Using a simple transaction model, it ~s shown that recognizing the transaction histories that are serlahzable is an NPcomplet ..."
Abstract

Cited by 246 (0 self)
 Add to MetaCart
complete problem. Several efficiently recognizable subclasses of the class of senahzable histories are therefore introduced; most of these subclasses correspond to senahzabdity principles existing in the hterature and used in practice Two new principles that subsume all previously known ones are also proposed
Recognizable sets of message sequence charts
 STACS 2002, LNCS 2030
, 2002
"... Abstract. Highlevel Message Sequence Charts are a wellestablished formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on starconnected HMSCs. We relate this subclass with recognizability and MSOdefinab ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
Abstract. Highlevel Message Sequence Charts are a wellestablished formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on starconnected HMSCs. We relate this subclass with recognizability and MSO
Syntactically Recognizable Modularly Stratified Programs
 University of Melbourne, Computer Science Department
, 1994
"... We present an efficient evaluation technique for modularly stratified programs for which the local strata level mappings are known at compile time. We present an important subclass of these programs (called EMSprograms) in which one can easily express problems such as shortest distance, company own ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present an efficient evaluation technique for modularly stratified programs for which the local strata level mappings are known at compile time. We present an important subclass of these programs (called EMSprograms) in which one can easily express problems such as shortest distance, company
Deterministic recognizability of picture languages by Wang automata⋆
"... Picture languages are a generalization of string languages to two dimensions: a picture is a twodimensional array of elements from a finite alphabet. Several classes of picture languages have been considered in the literature [6,8,3,11]. In particular, here we refer to class REC introduced in [6] w ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
deterministic subclasses of REC have been studied, e.g. the classes defined by deterministic 4way automata [8] or deterministic online tessellation acceptors [7]. This latter model inspired the notion of determinism of [1], that relies on four diagonal
Layered transducing term rewriting system and its recognizability preserving property
 In: Proc. 13th RTA Conf., Copenhagen (Denmark
, 2000
"... A term rewriting system which effectively preserves recognizability (EPRTRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LTTRSs) is defined and its recognizability preserving property is discussed. The class of LTTRSs contains some EPRTRSs, ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
A term rewriting system which effectively preserves recognizability (EPRTRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LTTRSs) is defined and its recognizability preserving property is discussed. The class of LTTRSs contains some EPR
Learning Local and Recognizable omegaLanguages and Monadic Logic Programs
"... We introduce two subclasses of regular !languages called local !languages and recognizable !languages, and give two learning algorithms for those subclasses. We also relate these results to the learning problem for the class of monadic logic programs. 1 Introduction In the study of inductive in ..."
Abstract
 Add to MetaCart
We introduce two subclasses of regular !languages called local !languages and recognizable !languages, and give two learning algorithms for those subclasses. We also relate these results to the learning problem for the class of monadic logic programs. 1 Introduction In the study of inductive
Polynomialtime Computation via Local Inference Relations
 ACM TRANS. COMPUT. LOGIC
, 2000
"... We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottomup evaluation terminates in polynomial time. The localruleset transformation gives polynomialtime evaluation strategies for a large variety of rule sets th ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
that cannot be given terminating evaluation strategies by any other known automatic technique. This paper discusses three new results. First, it is shown that every polynomialtime predicate can be defined by an (unstratified) local rule set. Second, a new machinerecognizable subclass of the local rule sets
New Results on Local Inference Relations
 In Principles of Knolwedge Representation and Reasoning: Proceedings of the Third International Conference
, 1992
"... We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom up evaluation terminates in polynomial time. The local rule set transformation gives polynomial time evaluation strategies for a large variety of rule sets th ..."
Abstract

Cited by 34 (10 self)
 Add to MetaCart
that can not be given terminating evaluation strategies by any other known automatic technique. This paper discusses three new results. First, it is shown that every polynomial time predicate can be defined by an (unstratified) local rule set. Second, a new machine recognizable subclass of the local rule
[Mathematical Logic and Formal Languages] Mathematical Logic—computability theory
"... We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottomup evaluation terminates in polynomial time. The localruleset transformation gives polynomialtime evaluation strategies for a large variety of rule sets th ..."
Abstract
 Add to MetaCart
that cannot be given terminating evaluation strategies by any other known automatic technique. This paper discusses three new results. First, it is shown that every polynomialtime predicate can be defined by an (unstratified) local rule set. Second, a new machinerecognizable subclass of the local rule sets
Results 1  10
of
31