This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
10973.3 The VDM Bibliography - Larsen (1995)(Correct)
This document contains the annotated VDM bibliography with 592 entries related to
VDM. The listed items come from a wide variety of sources, but unfortunately the list is not
yet exhaustive.
This ver... / Snelting. The PSG-System From Formal Language Definitions to Interactive br D. Bjrner. Programming Languages Formal Development of Interpreters
10670.0 TIGUKAT: A Uniform Behavioral Objectbase Management System - Peters (1994)(Correct)
Object-oriented computing is influencing many areas of computer science, including database systems. Despite many advances, object-oriented computing is still in its infancy and a universally accepted... / to the base object model. The formal languages include a declarative object br prove the equivalence of the formal languages. A reduction of the TIGUKAT
9381.8 A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991)(Correct)
This paper serves two purposes. Firstly, it is an elementary introduction to the
theory of P-completeness --- the branch of complexity theory that focuses on identifying
the problems in the class P th... / A. Formal Languages br flow local optimality logic formal languages algebraic geometry real
9027.5 Domain Theory - Abramsky, Jung (1994)(Correct)
bases were introduced in [Smyth, 1977] where they are called
"R-structures". Examples of abstract bases are concrete bases of continuous
domains, of course, where the relation OE is the restriction of... / this result in the context of formal language theory were Arden br and points We define a formal language of type expressions by the
8176.4 Temporal Query Languages: a Survey - Chomicki (1995)(Correct)
We define formal notions of temporal domain and temporal database, and use them
to survey a wide spectrum of temporal query languages. We distinguish between an
abstract temporal database and its conc... / database ffl query languages formal semantics expressiveness
7937.9 A Comprehensive Review of Production-Oriented Manufacturing Cell.. - Joines, King, Culbreth (1996)(Correct)
This paper offers a comprehensive review and classification of techniques to manipulate
part routing sequences for manufacturing cell formation. Individual techniques
are aggregated into methodologica... / pattern recognition and formal languages to design cells based on br Utilizing analytic methods from formal language theory complex patterns
7531.0 Formal Method Integration via Heterogeneous Notations - Paige (1997)(Correct)
Formal Method Integration
via
Heterogeneous Notations
Richard Freeman Paige
Doctor of Philosophy
Graduate Department of Computer Science
University of Toronto
1997
Method integration is the procedure ... / Y with domain being all the formal languages L i in the basis and br text and programming languages formalized typically using
7216.2 Knowledge Engineering: Principles and Methods - Studer, Benjamins, Fensel (1998)(Correct)
This paper gives an overview about the development of the field of Knowledge Engineering over the last 15 years. We discuss the paradigm shift from a transfer view to a modeling view and describe two ... / which is a semi-formal language with a graphical notation br and J. Balde ML A Formal Language for KADS Conceptual Models
6932.9 Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996)(Correct)
this
paper as candidates to represent the processes in a concurrent system or, more exactly, as representatives
of equivalent views on the processes. The main results give sufficient conditions for
ex... / of computer science such as formal language theory pattern recognition br to graphs of the theory of formal languages. Two essential aspects are
6838.5 Languages, Automata, and Logic - Thomas (1996)(Correct)
This paper is a survey on logical aspects of finite automata. Central points
are the connection between finite automata and monadic second-order logic, the
Ehrenfeucht-Fraiss'e technique in the contex... / technique in the context of formal language theory finite automata on br a chapter of the Handbook of Formal Language Theory edited by G.
5957.2 Extensions to the Relational Data Model - Scholl (1992)(Correct)
this paper we give an overview of research on extensions of relational database technology.
In order to systematically classify different ways to extend the data model we take
a programming language p... / Operators Typical formal languages for relations include br salary FROM employees Formal languages such as algebras or calculi
5887.1 Artificial Intelligence: A Computational Perspective - Nebel (1994)(Correct)
Although the computational perspective on cognitive tasks has always
played a major role in Artificial Intelligence, the interest in the precise
determination of the computational costs that are requi... / problems are also viewed as formal languages formed by the yes
5883.7 The Computational Analysis Of The Syntax And Interpretation Of "Free" .. - Hoffman (1995)(Correct)
THE COMPUTATIONAL ANALYSIS OF THE SYNTAX AND
INTERPRETATION OF "FREE" WORD ORDER IN TURKISH
Author: Beryl Hoffman
Supervisor: Mark Steedman
In this dissertation, I examine a language with "free" word... / . Formal Languages br the grammar for these formal languages. However the empty string
5676.8 Graph Transformation for Specification and Programming - Andries, Engels, Habel, Hoffmann.. (1996)(Correct)
The framework of graph transformation combines the potentials and advantages of both, graphs and rules, to a single computational paradigm. In this paper we present some recent developments in applyin... / systems as considered in formal language theory programmed graph br objects is quite popular in formal language theory. . A graph grammar
5568.1 Disjunctive Datalog - Eiter, Gottlob, Mannila (1997)(Correct)
We consider disjunctive datalog, a powerful database query language based on disjunctive logic programming. Briefly, disjunctive datalog is a variant of datalog where disjunctions may appear in the ru... / Math- ematical Logic and Formal Languages Mathematical Logic
5517.3 Modeling Beliefs In Dynamic Systems - Friedman (1997)(Correct)
tions beliefs. We say that an agent believes ' if she acts as
though ' is true. As time passes and new evidence is observed, changes in an agent's defeasible
assumptions lead to changes in her beliefs... /
5437.2 Foundations Of Recurrent Neural Networks - Siegelmann (1993)(Correct)
OF THE DISSERTATION
Foundations of Recurrent Neural Networks
by Hava (Eve) Tova Siegelmann, Ph.D.
Dissertation Director: Professor Eduardo D. Sontag
"Artificial neural networks" provide an appealing m... / science natural classes of formal languages are regular recursive and br natural choices of classes of formal languages are regular recursive and
5071.2 Non-Axiomatic Reasoning System - Exploring the Essence of Intelligence - Wang (1995)(Correct)
Every artificial-intelligence research project needs a working definition of "intelligence
", on which the deepest goals and assumptions of the research are based. In the
project described in the foll... / NARS uses a term-oriented formal language characterized by the use of br sense. Chapter describes the formal language used in the model which has
4951.5 The Design Of The User Interface For Software Development Tools - Toleman (1996)(Correct)
This thesis is concerned with design options for user interfaces for language-based
editors and in particular the evaluation of these options where competing choices
are available. Most design and eva... / particularly true for complex formal languages such as the specification br not only examine the use of formal languages such as programming
4861.1 The Power of Vacillation in Language Learning - John Case (1992)(Correct)
Some extensions are considered of Gold's influential model of language learning by machine
from positive data. Studied are criteria of successful learning featuring convergence in the limit
to vacilla... / data about membership in a formal language L and as a result br natural from the perspective of formal language theory such that some M
4520.9 Philippe Flajolet's Research In Analysis Of Algorithms And.. - Prodinger, Szpankowski (1998)(Correct)
Philippe Flajolet's research in theoretical computer science spans over more
than twenty years. He made lasting contributions to analysis of algorithms and analytic combinatorics.
Among many of his ... / enumeration number theory formal languages continued fractions br g. The set of all paths a formal language is given by the infinite
4459.9 Automatic Average-Case Analysis Of Algorithms - Flajolet, al. (1991)(Correct)
Many probabilistic properties of elementary discrete combinatorial structures of interest for the average--case analysis of algorithms prove to be decidable. This paper presents a general framework ... / from the classical theory of formal languages and enumerations. Example br In Computer Programing and Formal Languages P. Braffort and D.
4399.1 The Design and Implementation of TIGUKAT User Languages - Lipka (1993)(Correct)
To meet the data management requirements of new complex applications, object management systems
are emerging as the most likely candidate. The general acceptance of this new technology depends
on the ... / same expressive power as the formal languages. This thesis presents the br is proven equivalent to the formal languages of the query model calculus
4279.4 ffl-machine state for a hidden Markov model is a - Distribution Over(Correct)
e 17(a) as a discrete point set in the 3-simplex. Each point, somewhat enlarged
there, corresponds to one of the states in Figure 15. Two more examples of ffl-machines are
given in Figures 17(b) and 1... / the distribution's supporting formal languages. The Calculi of Emergence br deterministic states. In formal language theory it is well-known that
4165.1 How to Declare an Imperative - Wadler (1995)(Correct)
How can we integrate interaction into a purely declarative language? This tutorial describes a solution to this problem based on a monad. The solution has been implemented in the functional language H... / F. . Mathematical Logic and Formal Languages Mathematical
4094.6 Domain Based Testing: A Reuse Oriented Test Method - Mraz (1994)(Correct)
DOMAIN BASED TESTING : A REUSE ORIENTED TEST METHOD
In general, the test data generation problem is equivalent to the Halting Problem; therefore, it
is undecidable. This does not have to be the case f... / . Formal Language br . . Background -Using Formal Language for Test Generation
3923.6 On the Correspondence between Neural Folding Architectures and Tree.. - Küchler (1998)(Correct)
The folding architecture together with adequate supervised training algorithms is a special
recurrent neural network model designed to solve inductive inference tasks on structured
domains. Recently, ... / known from the theory of formal languages and automata especially br characterized by the classical formal language automata framework In the
3895.1 The Query Model and Query Language of TIGUKAT - Peters, Lipka, Özsu, Szafron (1993)(Correct)
The establishment of a formal object model provides a theoretical foundation to investigate other
objectbase features such as query processing. In this report, we present an extensible uniform
behavio... / is proven equivalent to the formal languages making it easy to perform br of the user language to the formal languages. Safety of our languages is
3792.0 Logics for Hybrid Systems - Davoren, Nerode (2000)(Correct)
Hybrid systems are heterogenous dynamical
systems characterized by interacting continuous and discrete
dynamics. Such mathematical models have proved fruitful
in a great diversity of engineering appli... / temporal logic automata formal languages software verification br characterized by an automaton formal language of finite or infinite words
3755.2 Efficient String Algorithmics - Breslauer (1992)(Correct)
Problems involving strings arise in many areas of computer science and have numerous
practical applications. We consider several problems from a theoretical perspective and
provide efficient algorithm... / compression coding theory formal languages and several other fields. In br theory automata theory formal language theory data compression and
3719.5 A Guided Tour Across the Boundaries of Learning Recursive Languages - Zeugmann, Lange (1994)(Correct)
The present paper deals with the learnability of indexed families of uniformly
recursive languages from positive data as well as from both, positive and
negative data. We consider the influence of var... / Inductive inference of formal languages may be characterized as the br in the limit. Gold-style formal language learning has been intensively
3700.2 Process Modelling Languages - This Chapter(Correct)
ion concepts may support the definition of more general,
3.3 Possible PML technologies from other languages / domains Page 63 of 86
Version 3.2 Draft 6/12/95
abstract submodels which are customized... / syntax and semantics. Semi-formal languages usually have a graphical br kernel SLANG that is a formal language based on Petri nets for
3528.1 Formalizing Automata II: Decidable Properties - Constable(Correct)
Is it possible to create formal proofs of interesting mathematical theorems which are mechanically
checked in every detail and yet are readable and even faithful to the best expositions
of those resul... / classic textbook Formal Languages and Their Relation to br Ullman's classic book Formal Languages and Their Relation to
3502.0 Formal Methods in Knowledge Engineering - van Harmelen, Fensel (1995)(Correct)
This paper presents a general discussion of the role of formal methods in Knowledge
Engineering. We give an historical account of the development of the field of
Knowledge Engineering towards the use ... / system. Much of this formal language development took place in br not the only source of formal languages. Formal modelling languages
3455.0 Formal Specification of Object Systems - Jungclaus, Saake, Sernadas (1991)(Correct)
The conceptual modeling of the Universe of Discourse (UoD) is an important
phase for the development of information systems because the conceptual model is
the basis for system development. Conceptual... / model we proposed a formal language Oblog which supports the
3431.6 Open Mechanized Reasoning Systems - McCarthy, Giunchiglia, Talcott (1992)(Correct)
Contents
Project Summary . . . . . . . . . . . . . . . . .
Introduction . . . . . . . . . . . . . . . . . . .
Our previous work in mechanized reasoning systems . . . . . . .
Existing reasoning system... / equivalent representations of formal languages or the simple example of
3427.9 Model Theoretic Syntax - Cornell, Rogers (1998)(Correct)
this article appeared in Glot, the
main issue agitating researchers in model theoretic syntax was the problem of
the context-free barrier. We have seen that the hierarchy of logics collapses,
when app... / also about grammar formalisms formal languages and generative capacity. It br retain strong connections to formal language theory. There it has
3426.0 Expressive Power of Declarative Programming Languages - Matsushita (1998)(Correct)
The thesis investigates several aspects of the expressive power of declarative programming
languages.
There seems to be no widely accepted definition of expressive power of programming
languages. In t... / subsets accept more complex formal languages in the Chomsky hierarchy. As br of the ability of accepting formal languages at various levels in the
3422.5 A Theory of Timed Automata - Alur, Dill (1994)(Correct)
We propose timed (finite) automata to model the behavior of realtime
systems over time. Our definition provides a simple, and yet powerful, way to
annotate state-transition graphs with timing constr... / from the perspective of formal language theory we consider closure br automatic verification formal languages and automata theory.
3389.7 A Constraint Based Structure Description Language for Biosequences - Eidhammer, Gilbert, Jonassen.. (1997)(Correct)
We report an investigation into how constraint solving techniques can be used to search
for patterns in sequences (or strings) of symbols over a finite alphabet. We define a
constraint-based structure... / with an a. In terms of formal languages the expressive power of br sequences. It is based on formal language theory and uses an indexed
3380.7 DNA computing: arrival of biological mathematics - Kari (1997)(Correct)
This article has benefited from discussions with
Leonard Adleman, Mark Gijzen, Greg Gloor, Tom Head, Jarkko Kari, Gheorghe
Paun, Clive Reis, Arto Salomaa, Gabriel Thierrin and Gary Walsh, to all
of wh... / is within the framework of formal language theory a branch of discrete br Our exposition requires a few formal language notions and notations
3363.3 The Complexity of Logic-Based Abduction - Eiter, Gottlob (1993)(Correct)
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a logical theory, we spea... / Mathematical Logic and Formal Languages Mathematical Logic
3357.6 Combinatorics of words - Choffrut, Karhumäki (1997)(Correct)
Introduction
The basic object of this chapter is a word, that is a sequence -- finite or
infinite -- of elements from a finite set. The very definition of a word immediately
imposes two characteristi... / from the point of view of formal languages. We do not intend to be br to their relevance to formal languages we have paid a special
3309.0 Generalized Alignment - McCarthy, Prince(Correct)
this paper. Financial support was provided to McCarthy by a fellowship from the John Simon Guggenheim Memorial Foundation and a Faculty Research Grant from the University of Massachusetts and to Princ... / specifying a class of formal languages that when substantive
3291.8 Program Derivation by Proof Transformation - Anderson (1993)(Correct)
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a constructive logic. Under this approach, the theorem-proving process can be regarded as a program de... / no set comprehensions in the formal language the notations used in the br in reasoning about programming languages formal logics and the like. The
3234.4 People-oriented Software Reuse: the Very Thought - Maiden, Sutcliffe (1993)(Correct)
Most software reuse research has ignored the role of the
software engineer. However, software engineers tend to be
better reasoners and have more experiences to recall than
tool-based reuse mechanisms... / semantics e.g. over formal languages faceted schemes was
3231.4 A Needed Narrowing Strategy - Antoy, Echahed, Hanus (1994)(Correct)
The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms. It also plays an important r... / F. . Mathematical Logic and Formal Languages Grammars and Other
3202.1 Conceptual and Formal Specifications of Problem-Solving Methods - Fensel, Eriksson, Musen, Studer (1996)(Correct)
Reusable problem-solving methods as provided by the PROTÉGÉ-II
improve knowledge engineering by allowing developers to design reasoners
quickly from pre-existing components. The PROTÉGÉ-II approach al... / and the relative benefits of formal languages versus source code in method br two methodsprecisely. Neither a formal language which would result in an
3179.3 Analytic Analysis of Algorithms - Flajolet (1992)(Correct)
The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis ... / range of applications includes formal languages tree enumerations br concern a variety of domains formal languages tree enumerations
3179.0 Parametricity and Local Variables - O'Hearn, Tennent (1995)(Correct)
We propose that the phenomenon of local state may be understood in terms of Strachey 's concept of parametric (i.e., uniform) polymorphism. The intuitive basis for our proposal is the following analog... / D. . Programming Languages Formal Definitions and Theory -
3154.9 Probabilistic Logic Programming with Conditional Constraints - Lukasiewicz (2000)(Correct)
We introduce a new approach to probabilistic logic programming in which probabilities
are defined over a set of possible worlds. More precisely, classical program clauses are extended by
a subinterv... / One important element of many formal languages for representing
3144.0 Docbase - A Database Environment For Structured Documents - Sengupta (1997)(Correct)
Standard Generalized Markup Language (SGML) has been widely accepted as a standard
for document representation. The strength of SGML lies in the fact that it embeds
logical structural information in d... / . . . . Formal languages . br this section we discuss the formal languages and SQL Structured Query
3119.6 Existential Second-Order Logic Over Strings - Eiter, Gottlob, Gurevich (1997)(Correct)
Existential second-order logic (ESO) and monadic second-order logic (MSO) have attracted
much interest in logic and computer science. ESO is a much more expressive logic over word
structures than MS... / a given formula Phi is a formal language. We can thus directly compare br directly compare classes of formal languages to logical formalisms. In
3117.4 Computing with Molecules - Rooss(Correct)
In 1994 Adleman published the description of a lab experiment,
where he computed an instance of the Hamiltonian path problem with
DNA in test tubes. He initiated a flood of further research on computi... / area from the theory of formal languages splicing systems model a br from the theory of formal languages. Already in an article
3110.5 Paradigm merger in natural language processing - Gazdar (1996)(Correct)
This chapter considers the revolution that has taken place in natural language
processing research over the last five years. It begins by providing
a brief guide to the structure of the field and then... / of computationally useful formal languages such as grammar and lexicon
3079.2 Parsing of Context-Free Languages - Sikkel, Nijholt (1997)(Correct)
Parsing is the process of assigning structure to sentences. The structure
is obtained from the grammatical description of the language. Both in Computer
Science and in Computational Linguistics, conte... / Eds.The Handbook of Formal Languages Vol. II Springer Verlag br theoretical computer science formal languages. This description is often
3032.5 The Three Dimensions of Requirements Engineering - Pohl (1993)(Correct)
Requirements engineering (RE) is perceived as an area of growing importance.
Due to the increasing effort spent for research in this area many contributions
to solve different problems within RE exi... / more people suggest to use a formal language for representing the br of the system. Additionally a formal language offers the possibility of
2996.3 The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross, Schlipf (1991)(Correct)
A general logic program (abbreviated to "program" hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consi... / F. . Mathematical Logic and Formal Languages Mathematical Logic - br D. . Programming Languages Formal Definitions and Theory
2987.1 Number Theory And Formal Languages - Shallit (1999)(Correct)
I survey some of the connections between formal languages and number
theory. Topics discussed include applications of representation in base k, representation
by sums of Fibonacci numbers, automatic... / Number Theory And Formal Languages Jeffrey Shallit br of the connections between formal languages and number theory. Topics
2980.2 Omega-Languages - Staiger (1997)(Correct)
This paper will be a chapter of the Handbook of Formal Languages , Vol. 3, edited by G. Rozenberg
and A. Salomaa, which is to appear in Springer-Verlag, Berlin. unknown !-languages
Ludwig Staiger
Mar... / a chapter of the Handbook of Formal Languages Vol. edited by G. br information theory. In formal language theory we are mainly
2959.4 Valuations Of Languages, With Applications To Fractal Geometry - Henning Fernau (1994)(Correct)
Valuations ---morphisms from (\Sigma
; \Delta; ) to ((0; 1); \Delta; 1)--- are a simple generalization
of Bernoulli morphisms (distributions, measures) as introduced in [28, 41, 11, 9, 10, 42]. T... / Euclidean spaces defined via formal languages. The class of fractals br measure theoretic arguments in formal language theory. Instead of discarding
2916.1 Specifying Real-Time Finite-State Systems in Linear Logic - Kanovich, Okada, Scedrov (1998)(Correct)
Real-time finite-state systems may be specified in linear logic by means of linear implications
between conjunctions of fixed finite length. In this setting, where time is treated as a
dense linear or... / to resort to various formal languages for this purpose. Among br this purpose. Among these the formal language that has been most
2895.2 Should Your Specification Language Be Typed? - Lamport, Paulson (1998)(Correct)
Most specification languages have a type system. Type systems are hard to get
right, and getting them wrong can lead to inconsistencies. Set theory can serve
as the basis for a specification language ... / . Typed Formal Languages . Typed Set Theory . br of some object. Typed Formal Languages Types in programming
2894.2 Heterogeneous Notations for Formal Method Integration - Paige (1997)(Correct)
We describe an approach for defining and making use of compositions
of partial specifications written in different formal languages. The technique provides
a first step towards integrating formal me... / written in different formal languages. The technique provides a br . . Expressiveness The formal languages in the heterogeneous
2875.4 Process And Policy: Resource-Bounded Non-Demonstrative Reasoning - Loui (1993)(Correct)
This paper investigates the appropriateness of formal dialectics as a basis for non-monotonic reasoning and defeasible reasoning that takes computational limits seriously. Rules that can come into con... / of mathematically satisfying formal languages. For non-demonstrative
2875.1 Data-Oriented Language Processing - An Overview - Bod, Scha (1996)(Correct)
Data-oriented models of language processing embody the assumption that human language
perception and production works with representations of concrete past language experiences,
rather than with abstr... / natural languages after the formal languages of logic and mathematics as br Representation of Formal Languages Tenth Annual IEEE
2859.8 On Binary Methods - Bruce, Cardelli, Castagna, Group.. (1995)(Correct)
data types, modules, packages; F.3.1 [Logics and Meanings of Programs ] Specifying
and Verifying and Reasoning about Programs --- logics of programs; F.3.2 [Logics and Meanings of
Programs ] Studies o... / D. . Programming Languages Formal Definitions and Theory -
2855.6 Inductive Program Synthesis for Therapy Plan Generation - Arnold, Jantke (1996)(Correct)
Planning is investigated in an area where classical Strips-
like approaches usually fail. The application domain is therapy (i.e. repair)
for complex dynamic processes. The peculiarities of this do... / is well-specified by the formal languages of all graphs which can be br Daniel Kirsten. Properties of formal languages of therapy plans created by
2854.9 Transformation of structured documents - Kuikka, Penttonen (1995)(Correct)
Structure definitions of documents have been used successfully for inputting and formatting
in text processing systems. This report considers transformations between different
representations of struc... / compilation theory for formal languages offers a set of well-defined br in the compilation of formal languages. The translation schema is
2843.7 Synthesizing Enumeration Techniques For Language Learning - Baliga, Case, Jain (1996)(Correct)
This paper provides positive and negative
results on algorithmically synthesizing, from
grammars and from decision procedures for
classes of languages, learning machines for identifying,
from positive... / formal grammars for formal languages from positive information br points out all of the formal language style example classes are
2754.3 A Framework for Defining Logics - Harper, Honsell, Plotkin (1987)(Correct)
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus with dependent types.... / F. . Mathematical Logic and Formal Languages Mathematical Logic.
2578.9 The Artificial Life of Plants - Prusinkiewicz, Hammel, Mech(Correct)
In these notes we survey applications of L-systems to the modeling of plants, with
an emphasis on the results obtained since the comprehensive presentation of this area
in The Algorithmic Beauty of Pl... / to abstract automata and formal languages and attracted the immediate br . A. Salomaa. Formal languages. Academic Press New York
2578.9 POTS: A OO LOTOS Approach - Gibson, Mokhtari (1996)(Correct)
ion: classes define an abstract interface behind which all the properties
of objects in the class are encapsulated.
ffl Re-use: classes provide a fundamental package of re-usable behaviour.
ffl Vali... / systems is well documented. Formal languages have been used in the br concepts in an existing formal language. Good examples of the type
2575.5 An historical overview of natural language processing systems that.. - Collier (1994)(Correct)
A fundamental issue in natural language processing is the prerequisite
of an enormous quantity of preprogrammed knowledge
concerning both the language and the domain under
examination. Manual acqui... / that learn the structure of formal languages and cognitive models which
2536.6 Types for Proofs and Programs - Grobauer (1999)(Correct)
pport.
Contents
1 Introduction and Overview 1
2 Types for Proofs 2
2.1 Formal Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.1.1 What is a Formal System? . .... / formal systems one or more formal languages and judgment s over the
2534.9 The Recursively Enumerable Degrees - Shore (1997)(Correct)
this paper were then used to refute Sacks' conjecture
on the isomorphism of the r. e. degrees to those r. e. in and above any
degree d.
Theorem 3.3. (Shore [1982]) For each degree d and each set A whi... / we code all expressions in formal languages groups etc. as natural
2528.2 Behavioral Subtyping in Object-Oriented Languages - Dhara (1997)(Correct)
data types,
modules, packages; F.3.1 [Logics and Meanings of Programs] Specifying and Verifying
and Reasoning about Programs --- logics of programs, pre- and post-conditions,
theory
A version of this ... / D. . Programming Languages Formal Definitions and Theory -
2509.7 Grammars++ for Modelling Information in Text - Salminen, Tompa (1996)(Correct)
Grammars provide a convenient means to describe the set of valid strings in a
language, and thus they seem natural for describing the set of valid instances in a text
database. It is well-known that a... / provided by the field of formal languages where text strings are br context-free grammar defines a formal language i.e.a set of strings by
2497.4 Towards an efficient description logics system with individuals - Tessaris (1998)(Correct)
This report presents the status of the research the author is conducting on the development of a complete Description Logics knowledge representation system. Description Logics knowledge representatio... / are based of a family of formal languages for describing complex br represent the domain using a formal language. In these systems a precise
2476.2 Metalogical Frameworks - Basin, Constable (1992)(Correct)
In computer science we speak of implementing a logic; this is done in a programming
language, such as Lisp, called here the implementation language. We also reason
about the logic, as in understanding... / of automata theory formal languages and programming logics.
2472.4 Asymptotic Properties Of Data Compression And Suffix Trees - Szpankowski (1993)(Correct)
Recently, Wyner and Ziv have proved that the typical length of a repeated subword found within the first n positions of a stationary ergodic sequence is (1=h) log n in probability where h is the entro... / compression in the theory of formal languages and in the design and
2459.1 HYDRA: A Hypertext Model for Structuring Informal Requirements.. - Pohl, Haumer (1995)(Correct)
The ultimate measurement for software quality is the degree to which user needs
are satisfied by the system. User needs are an essential input for developing a requirements
specification and, in the... / category subsumes the semi-formal languages such as SA-diagrams br etc. The third category covers formal languages such as specification
2431.9 Partial-Order Process Algebra (and its Relation to Petri Nets) - Baeten, Basten (2000)(Correct)
To date, many different formalisms exist for describing and analyzing the behavior of concurrent systems.
Petri nets and process algebras are two well-known classes of such formalisms. Petri-net theo... / computing science. Numerous formal languages for describing and analyzing br of expressions in such a formal language is often captured in a
2428.6 Algebraic Processing of Programming Languages - Rus (1995)(Correct)
Current methodology for compiler construction evolved in small increments over a long
period of time. Its heritage is machine-dependent and derived from sequential Von Neumann
machines. There is a gro... / within the framework of formal languages The computations br Hopcroft and J.D. Ullman. Formal Languages and Their Relation to
2350.4 An Equational Axiomatization for Multi-Exit Iteration - Aceto, Fokkink (1996)(Correct)
This paper presents an equational axiomatization of bisimulation equivalence
over the language of Basic Process Algebra (BPA) with multi-exit iteration. Multiexit
iteration is a generalization of the ... / to the point of view of formal language theory a regular expression br notions from the theory of formal languages. For example the complete
2343.4 A Comparison of Languages which Operationalize and Formalise KADS.. - Fensel, van Harmelen (1994)(Correct)
In the field of Knowledge Engineering, dissatisfaction with the rapidprototyping approach has led to a number of more principled methodologies for the construction of knowledge based systems. Instea... / KBS. We describe eight formal languages for KADS models of expertise br unambiguous and preferably formal language that abstracts from
2302.1 From Inheritance Relation to Non-Axiomatic Logic - Wang (1994)(Correct)
Non-Axiomatic Reasoning System is an adaptive system that works with insufficient
knowledge and resources.
At the beginning of the paper, three binary term logics are defined. The first is
based only ... / . A domain-independent formal language by which the system can br as they are expressible in the formal language Adaptive The system
2299.2 Properties of monoids that are presented by finite convergent.. - Otto, Kobayashi (1997)(Correct)
In recent years a number of conditions has been established that a monoid must
necessarily satisfy if it is to have a presentation through some finite convergent stringrewriting
system. Here we give a... / are at the very heart of formal language theory. Finally they are br stringrewriting systems and formal language theory see Ber In
2289.0 Eta-Expansion does the Trick - Danvy, Malmkjær, Palsberg (1996)(Correct)
ion theorem in the first-order
case [Holst and Hughes 1990; Reynolds 1983; Wadler 1989]. The composition of
specialization and list lookup is replaced by the composition of lookup and map of
specializ... / Mathematical Logic and Formal Languages Mathematical
2287.4 Two Variations of Inductive Inference of Languages from Positive Data - Tabe, Zeugmann (1995)(Correct)
The present paper deals with the learnability of indexed families of uniformly recursive
languages by single inductive inference machines (abbr. IIM) and teams of IIMs from
positive and both positive ... / with inductive inference of formal languages a field in which many br we assume familiarity with formal language theory cf.e.g.Hopcroft
2279.3 A survey on DNA computing - Pisanti (1997)(Correct)
The aim of this report is to make a review on DNA computing :
molecular biology is used to suggest a new way of solving a NP-
complete problem. The idea (due to Leonard Adleman in [Adl94]) is
to use ... / DNA computations using the formal languages theory. A brief br of DNA molecules in terms of formal languages. The splicing systems were
2273.1 Knowledge Engineering in the Communication of Information for Safety.. - Gurr (1996)(Correct)
The design and assessment of safety critical systems often involves broad and distributed
teams of designers, suppliers and analysts who represent diverse areas of expertise and motivations.
Accurat... / address the visualisation of formal languages and arguments. These issues br Systems an algebraic formal language for modelling concurrent
2242.8 Is Anything Ever New? - Considering Emergence - Crutchfield (1994)(Correct)
This brief essay reviews an approach to defining and then detecting the emergence of complexity in
nonlinear processes. It is, in fact, a synopsis of Reference [1] that leaves out the technical
detail... / of discrete symbols a formal language -that computation theory br . . M. G. Nordahl. Formal languages and finite cellular automata.
2236.9 Generation of LR Parsers by Partial Evaluation - Michael Sperber, Peter Thiemann (2000)(Correct)
this paper appeared in Proceedings of the ACM SIGPLAN Symposium
on Partial Evaluation and Semantics-Based Program Manipulation, 1995 under the title
"The Essence of LR Parsing."
Authors' addresses:
Mi... / F. . Mathematical Logic and Formal Languages Grammars and Other br compiler front ends and other formal language processors. LR parsing is
2228.5 Plausibility Measures and Default Reasoning - Friedman (1996)(Correct)
this paper: default reasoning. In recent years, a number of different semantics for defaults have been proposed, such as preferential structures, ffl-semantics, possibilistic structures, and -rankings... / F. . Mathematical Logic and Formal Languages Mathematical Logic
2222.8 Reasoning about Knowledge and Probability - Fagin, Halpern (1994)(Correct)
We provide a model for reasoning about knowledge and probability
together. We allow explicit mention of probabilities in formulas, so
that our language has formulas that essentially say "according t... / they have not considered formal languages containing knowledge and
2211.8 Algebra of Flownomials; Part 1: Binary Flownomials; Basic Theory - Stefanescu(Correct)
morphism for connecting flowgraphs are used in [CaU82] and in all of
our subsequent papers on flowchart schemes and flownomials, see [Ste87a, Ste87b,
CaS88a, CaS90a, CaS92].
This chapter folows Chap... / sequential programs automata formal languages circuits etc. but less in
2208.6 Automata-theoretic Verification of Real-Time Systems - Alur, Dill (1995)(Correct)
this paper, we used automata not only to describe the system, but also to write correctness
requirements. Alternatively, real-time requirements can be written as formulas of timed temporal
logics. Mod... / Since a set of sequences is a formal language this leads naturally to the br traces into an ordinary formal language is not obvious. Instead we
2182.0 Efficient Learning of One-Variable Pattern Languages from Positive.. - Erlebach, Rossmanith, Stadtherr.. (1996)(Correct)
A pattern is a finite string of constant and variable symbols. The language
generated by a pattern is the set of all strings of constant symbols which can be
obtained from the pattern by substituting ... / a very natural way to define formal languages. Suppose you are interested br learning model. Let L be any formal language then a text for L is any
2150.6 A Graphical Environment for Design of Concurrent Real-Time Systems - Moser, Ramakrishna, KUTTY..(Correct)
ion, Composition, and Refinement
In RTGIL, as well as in other logics [Abadi and Lamport 1995], composition is
represented by the conjunction of specifications. A primary concern when composing
speci... / Mathemat- ical Logic and Formal Languages Mathematical br theorem proving Formal Languages-decision problems
2144.1 Existential Second-Order Logic over Strings (Extended Abstract) - Eiter, Gottlob, Gurevich(Correct)
Existential second-order logic (ESO) and monadic
second-order logic (MSO) have attracted much interest
in logic and computer science. ESO is a much
more expressive logic over word structures than MSO.... / J.E. Pin. Varieties of Formal Languages. North Oxford London and br Salomaa editors Handbook of Formal Language Theory III pp. - .
2140.3 Modelling Objects in PICT - Schneider, Lumpe (1996)(Correct)
For the development of present-day applications, programming languages supporting
high order abstractions are needed. These high order abstractions are called components.
Since most of the currently a... / F. . Mathematical Logic and Formal Languages Formal Languages. br Logic and Formal Languages Formal Languages. Authors' address
2122.6 Two Components of An Action Language - Lifschitz (1996)(Correct)
Some of the recent work on representing action makes use of high-level action languages.
In this paper we show that an action language can be represented as the sum of two distinct
parts: an "action d... /
2104.8 A Formal Basis for Architectural Connection - Allen, Garlan (1997)(Correct)
Machine as the underlying formalism [Inverardi and Wolf 1995]. 246 . Robert Allen and David Garlan ACM Transactions on Software Engineering and Methodology, Vol. 6, No. 3, July 1997. 13.4 Style An imp... / F. . Mathematical Logic and Formal Languages Formal Languages-CSP br Logic and Formal Languages Formal Languages-CSP General Terms
2103.7 Maintenance of Object-oriented Systems during Structural Evolution - Bergstein (1994)(Correct)
ion
of common parts and distribution of common parts are
extended to apply to syntax edges as well as attribute edges.
The only additional complexity is that abstraction of common
parts to a superclas... / with a theoretical basis in formal languages. We view the original and br basis of the current work in formal languages. In our case the program
2090.9 Formalizing Automata Theory I: Finite Automata - Constable, Jackson, Naumov, Uribe (1997)(Correct)
This article and the World Wide Web display of computer checked proofs is an experiment
in the formalization of computational mathematics.
1
Readers are asked to judge whether this
formalization add... / Hopcroft and Ullman's book Formal Languages and Their Relation to br equivalence relation formal languages LCF Martin-Lof semantics
2086.3 Supporting the Use of External Representations in Problem Solving.. - Cox (1995)(Correct)
External representations (ERs) are effective in reasoning due to their cognitive and semantic properties. We investigated subjects' use of ERs in their solutions to analytical reasoning problems. Two ... / language sentences of formal languages e.g. first-order logic br in terms of specificity than formal languages such as first order logic.
2050.6 A Visual Toolset for the Design of Real-Time Discrete Event Systems - Ostroff (1997)(Correct)
StateTime is a prototype toolset that supports the
design of verified real-time discrete event systems using executable
visual state descriptions (the Build tool). Visual state descriptions
allow th... / and infinite string formal languages leading to the solution of br can be checked by testing the formal language containment Spin supports
2045.5 A New Parallel Vector Model, With Exact Characterizations of NC k - Regan (1993)(Correct)
This paper develops a new and natural parallel vector model, and shows that for all
k 1, the languages recognizable in O(log
k
n) time and polynomial work in the model
are exactly those in NC
k
... / complexity automata and formal languages parallel algorithms. .
2038.5 Rule Revision with Recurrent Neural Networks - Omlin, Giles (1996)(Correct)
Recurrent neural networks readily process, recognize and generate temporal sequences. By encoding
grammatical strings as temporal sequences, recurrent neural networks can be trained to behave like det... / the smallest class of formal languages in the Chomsky hierarchy
2035.4 A Parallel Narrowing Strategy - Antoy, Echahed, Hanus (1996)(Correct)
We generalize to narrowing the notion of necessary set of redexes proposed by Sekar
and Ramakrishnan for rewriting in weakly orthogonal, constructor-based rewrite
systems. We define two strategies, on... / F. . Mathematical Logic and Formal Languages Grammars and Other
2032.6 A Software Architecture for Knowledge-Based Systems - Fensel, Groenboom (1999)(Correct)
The paper introduces a software architecture for the
specification and verification of knowledge-based systems combining
conceptual and formal techniques. Our focus is component-based
specificati... / and J. Balder ML A Formal Language for KADS Conceptual Models
2022.7 Probabilistic Pattern Matching and the Evolution of Stochastic.. - Ross (1999)(Correct)
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound semantics, as well as a... / Stochastic languages are formal languages with probability distribution br Section . Related Work Formal Language Induction Has A Long History
2021.3 A Unified Treatment of Uncertainties - Wang (1993)(Correct)
Uncertainty in artificial intelligence" is an active research field, where several approaches
have been suggested and studied for dealing with various types of uncertainty. However, it's
hard to rank... / provides a mapping of the two formal languages so that the system can br loosely relates the two formal languages to natural language so to
2019.4 From Algol to Polymorphic Linear Lambda-calculus - O'Hearn, Reynolds (1997)(Correct)
ion and Store Shapes . . . . . . . . . . 6 2 Two Variations on Algol 8 2.1 Idealized Algol . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Name: P.W. O'Hearn Address: Department of Compu... / D. . Programming Languages Formal Definitions and
2012.6 Formal Language, Grammar and Set-Constraint-Based Program Analysis by .. - Cousot, Cousot (1995)(Correct)
Grammar-based program analysis ŕ la Jones and Muchnick and set-constraint-based program analysis ŕ la Aiken and Heintze are static analysis techniques that have traditionally been seen as quite differ... / Formal Language Grammar and br are coded using tuples of formal languages. A further approximation is
2012.1 Specifications Are (Preferably) Executable - Fuchs (1992)(Correct)
ion of the Specification
Borrowing a saying of Einstein's, I maintain that specifications should be as abstract as possible, but not
more abstract. I see three limitations to the degree of abstractio... / advantages Gehani Since a formal language has a well-defined syntax br consider specifications in formal languages. Descriptions in natural
2010.6 From String Rewriting to Logical Metabolic Systems - Manca, Martino (1997)(Correct)
this paper we focus on the notion of metabolism and the way it can be
expressed in symbolic terms. We claim that an adequate formalization of this
concept could help to unify several approaches based ... / rewriting system Grammar Formal Language Formal System L-systems br of interaction between formal languages and biology arise from
2004.3 The Interpretation of Fuzziness - Wang (1996)(Correct)
Without a clear interpretation of fuzziness, it is hard for fuzzy logic to justify its rules, to get initial data from users, or to make its results understandable. It is possible to interpret grade o... /
1985.1 Graph Transformation Units with Interleaving Semantics - Kreowski, Kuske (1999)(Correct)
The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from sma... / and logic programming formal languages algebraic specification br objects is quite popular in formal language theory. . Graph theoretic
1981.3 Vql : A Visual Query Language For Uniform Database Access - Yuksel Alp(Correct)
by
YUKSEL ALP ASLANDOGAN
In this work, we present VQL, a Visual Query Language based on the concepts
of windows and example elements. It utilizes the "restricted universal quantifier
" operator in a f... / of non-visual declarative formal languages were also proposed CKW br which combines the power of a formal language with the power of windows.
1966.4 Towards Validation of Data Mining Systems - Jantke (1997)(Correct)
The growing complexity of systems humans
are able to design and implement has lead to an
obvious need to develop methodologies and techniques
for the validation of intelligent systems.
Otherwise, the ... / Over sufficiently expressive formal languages there is an infinite set of
1960.4 Action Logic and Pure Induction - Pratt (1991)(Correct)
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action
logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evalua... / regular expressions as formal languages sets of strings over some br more strings of L. In the formal language literature the quotient
1956.4 Profinite methods in semigroup theory - Weil (2000)(Correct)
this paper. The extended bibliography given below shows other important contributions by
Azevedo, Costa, Delgado, Pin, Teixeira, Volkov, Weil and Zeitoun. unknown Profinite methods
in semigroup theor... / connections with the theory of formal languages via Eilenberg's variety br due to the connections with formal language theory first established by
1950.7 Application of stochastic grammars to understanding action - Ivanov (1998)(Correct)
This thesis addresses the problem of using probabilistic formal languages to describe and
understand actions with explicit structure. The thesis explores several mechanisms of parsing
the uncertain in... / problem of using probabilistic formal languages to describe and understand br is based on the advances of the formal language theory and computational
1946.7 Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)(Correct)
interpretation, alias analysis, constraint solving,
dataflow analysis, destructive updating, pointer analysis, shape analysis, static analysis, 3-valued
logic
1. INTRODUCTION
Data structures built us... / F. . Mathematical Logic and Formal Languages Mathematical
1944.1 Classifying Predicates and Languages - Smith, Wiehagen (1997)(Correct)
The present paper studies a particular collection of classification problems,
i.e., the classification of recursive predicates and languages, for arriving at a
deeper understanding of what classific... / numbers also represent formal languages. Hence we simultaneously br Inductive inference of formal languages from positive data
1925.8 Class-Based and Algebraic Models of Objects - Leavens, Pigozzi (1998)(Correct)
data types; F.3.2 [Logics and Meanings of Programs ] Semantics of
Programming Languages --- algebraic approaches to semantics, denotational
sematics.
Submitted for publication.
c fl Gary T. Leavens ... / D. . Programming Languages Formal Definitions and Theory -
1921.1 Synthesis of Mixed Software-Hardware Implementations from CFSM.. - Chiodo, Giusto, Hsieh, Jurecska.. (1993)(Correct)
Embedded controllers for reactive real-time applications are implemented as mixed softwarehardware
systems. In [CGH
+
93], a formal specification model called Co-design Finite State
Machine (CFSM) i... / CSV are . An array of formal languages each of which is mapped into br HW synthesis Partitioning Formal Languages FL Compilers SIS C code
1915.8 Gates Accept Concurrent Behavior - Gupta (1993)(Correct)
We represent concurrent processes as Boolean propositions or gates, cast in the role of acceptors of concurrent behavior. This properly extends other mainstream representations of concurrent behavior ... / understood today in terms of formal languages as sets of possibly infinite br between automata and formal languages. True concurrency makes
1914.8 Logic Journal of the IGPL 8:3 - Areces, Franconi, Goré, de.. (2000)(Correct)
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised
by constructors to build complex concepts and roles from atomic ones. Expressive role constructors
are... / artificial intelligence formal languages etc. Going in the br and A. Salomaa. Handbook of Formal Languages. Springer . K.
1900.8 Parsing Schemata and Correctness of Parsing Algorithms - Sikkel (1998)(Correct)
Parsing schemata provide a high-level formal description of parsers. These can be used, among others, as an intermediate level of abstraction for deriving the formal correctness of a parser. A parser ... / A fundamental theorem in formal language theory states that the class br A. Eds Handbook of Formal Languages Vol. II Springer Verlag
1896.1 Graph Transformation Units And Modules - Kreowski, Kuske (1999)(Correct)
The significance of graphs and rules in many areas of computer science is evident: On the one hand, graphs constitute appropriate means for the description of complex relationships between objects. Tr... / and logic programming formal languages algebraic specification br objects is quite popular in formal language theory. . Graph theoretic
1886.8 Constructively Formalizing Automata Theory - Constable, Jackson, Naumov, Uribe (1997)(Correct)
We present a constructive formalization of the Myhill-Nerode theorem
on the minimization of finite automata that follows the account
in Hopcroft and Ullman's book Formal Languages and Their Relation
t... / in Hopcroft and Ullman's book Formal Languages and Their Relation to br equivalence relation formal languages foundational logic LCF
1882.8 Novel Techniques For Image Texture Classification - Chen (1995)(Correct)
Texture plays an increasingly important role in computer vision. It has found
wide application in remote sensing, medical diagnosis, quality control, food inspection
and so forth. This thesis investig... / are based on the theory of formal languages a texture image is regarded
1880.7 Characterizing PAC-learnability of Semilinear Sets - Naoki Abe (1995)(Correct)
The learnability of the class of letter-counts of regular languages (semilinear sets) and other
related classes of subsets of N
d
with respect to the distribution-free learning model of Valiant
(PAC... / applied in the context of formal languages. We note that a number of br and equivalence queries for formal languages have recently been
1878.3 Representing Proof Transformations for Program Optimization - Anderson (1994)(Correct)
In the proofs as programs methodology a program is derived from a formal constructive proof. Because of the close relationship between proof and program structure, transformations can be applied to ... / in reasoning about programming languages formal logic and the like. The