Results 1  10
of
99
WellStructured Transition Systems Everywhere!
 THEORETICAL COMPUTER SCIENCE
, 1998
"... Wellstructured transition systems (WSTS's) are a general class of infinite state systems for which decidability results rely on the existence of a wellquasiordering between states that is compatible with the transitions. In this article, we provide an extensive treatment of the WSTS idea and ..."
Abstract

Cited by 258 (9 self)
 Add to MetaCart
Wellstructured transition systems (WSTS's) are a general class of infinite state systems for which decidability results rely on the existence of a wellquasiordering between states that is compatible with the transitions. In this article, we provide an extensive treatment of the WSTS idea and show several new results. Our improved definitions allow many examples of classical systems to be seen as instances of WSTS's.
Natural termination
 Theoretical Computer Science
"... Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving termination of orthogonal systems and give a new solution to a problem of Zantema's. 1 ..."
Abstract

Cited by 86 (11 self)
 Add to MetaCart
(Show Context)
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving termination of orthogonal systems and give a new solution to a problem of Zantema's. 1
The Complexity of Querying Indefinite Data about Linearly Ordered Domains
 In The Proceedings of the Eleventh ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
, 1992
"... In applications dealing with ordered domains, the available data is frequently indefinite. While the domain is actually linearly ordered, only some of the order relations holding between points in the data are known. Thus, the data provides only a partial order, and query answering involves determin ..."
Abstract

Cited by 46 (2 self)
 Add to MetaCart
(Show Context)
In applications dealing with ordered domains, the available data is frequently indefinite. While the domain is actually linearly ordered, only some of the order relations holding between points in the data are known. Thus, the data provides only a partial order, and query answering involves determining what holds under all the compatible linear orders. In this paper we study the complexity of evaluating queries in logical databases containing such indefinite information. We show that in this context queries are intractable even under the data complexity measure, but identify a number of PTIME subproblems. Data complexity in the case of monadic predicates is one of these PTIME cases, but for disjunctive queries the proof is nonconstructive, using wellquasiorder techniques. We also show that the query problem we study is equivalent to the problem of containment of conjunctive relational database queries containing inequalities. One of our results implies that the latter is \Pi p 2 ...
Specialization of Lazy Functional Logic Programs
 IN PROC. OF THE ACM SIGPLAN CONF. ON PARTIAL EVALUATION AND SEMANTICSBASED PROGRAM MANIPULATION, PEPM'97, VOLUME 32, 12 OF SIGPLAN NOTICES
, 1997
"... Partial evaluation is a method for program specialization based on fold/unfold transformations [8, 25]. Partial evaluation of pure functional programs uses mainly static values of given data to specialize the program [15, 44]. In logic programming, the socalled static/dynamic distinction is hard ..."
Abstract

Cited by 36 (21 self)
 Add to MetaCart
(Show Context)
Partial evaluation is a method for program specialization based on fold/unfold transformations [8, 25]. Partial evaluation of pure functional programs uses mainly static values of given data to specialize the program [15, 44]. In logic programming, the socalled static/dynamic distinction is hardly present, whereas considerations of determinacy and choice points are far more important for control [12]. We discuss these issues in the context of a (lazy) functional logic language. We formalize a twophase specialization method for a nonstrict, first order, integrated language which makes use of lazy narrowing to specialize the program w.r.t. a goal. The basic algorithm (first phase) is formalized as an instance of the framework for the partial evaluation of functional logic programs of [2, 3], using lazy narrowing. However, the results inherited by [2, 3] mainly regard the termination of the PE method, while the (strong) soundness and completeness results must be restated for the lazy strategy. A postprocessing renaming scheme (second phase) is necessary which we describe and illustrate on the wellknown matching example. This phase is essential also for other nonlazy narrowing strategies, like innermost narrowing, and our method can be easily extended to these strategies. We show that our method preserves the lazy narrowing semantics and that the inclusion of simplification steps in narrowing derivations can improve control during specialization.
On the Classical Decision Problem
 Perspectives in Mathematical Logic
, 1993
"... this paper. In particular, their comments inspired and gave arguments for the discussion on the value of the classical decision problem after Church's and Turing's results. References ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
(Show Context)
this paper. In particular, their comments inspired and gave arguments for the discussion on the value of the classical decision problem after Church's and Turing's results. References
Model checking multithreaded programs with asynchronous atomic methods
 In CAV 06, LNCS 4314
, 2006
"... ..."
(Show Context)
Aggregate functions, conservative extension, and linear orders
 In Proceedings of 4th International Workshop on Database Programming Languages
, 1993
"... Practical database query languages are usually equipped with some aggregate functions. For example, \ nd mean of column " can be expressed in SQL. However, the manner in which aggregate functions were introduced in these query languages leaves something to be desired. BreazuTannen, Buneman, a ..."
Abstract

Cited by 34 (27 self)
 Add to MetaCart
(Show Context)
Practical database query languages are usually equipped with some aggregate functions. For example, \ nd mean of column " can be expressed in SQL. However, the manner in which aggregate functions were introduced in these query languages leaves something to be desired. BreazuTannen, Buneman, and Wong [3] introduced a nested relational languageNRC(=) based on monads [16, 24] and structural recursion [1, 2]. It was shown in Wong [27] that this language is equivalent to the nested relational algebras of Thomas and Fischer [22], Schek and Scholl [20], and Colby [4]. NRC(=) enjoys certain advantages over these languages: it is naturally embedded in functional languages, it is readily extensible, and it has a compact equational theory. Therefore, it is used in this report as a basis for investigating aggregate functions. In section 2, the nested relational calculus NRC(=) is described. It is then endowed with rational numbers, rational arithmetic, and a summation operator. The augmented language,NRC(Q; +; ; ; ; P; =), is able to express a variety
Finite generation of symmetric ideals
 TRANS. AMER. MATH. SOC
, 2005
"... Let A be a commutative Noetherian ring, and let R = A[X] be the polynomial ring in an infinite collection X of indeterminates over A. Let SX be the group of permutations of X. The group SX acts on R in a natural way, and this in turn gives R the structure of a left module over the left group ring R ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
Let A be a commutative Noetherian ring, and let R = A[X] be the polynomial ring in an infinite collection X of indeterminates over A. Let SX be the group of permutations of X. The group SX acts on R in a natural way, and this in turn gives R the structure of a left module over the left group ring R[SX]. We prove that all ideals of R invariant under the action of SX are finitely generated as R[SX]modules. The proof involves introducing a certain wellquasiordering on monomials and developing a theory of Gröbner bases and reduction in this setting. We also consider the concept of an invariant chain of ideals for finitedimensional polynomial rings and relate it to the finite generation result mentioned above. Finally, a motivating question from chemistry is presented, with the above framework providing a suitable context in which to study it.