Results 21  30
of
221
CPI: ConstraintsPreserving Inlining Algorithm for Mapping XML DTD to Relational Schema
 J. Data & Knowledge Engineering (DKE
, 2001
"... mapping XML DTD to relational schema ..."
Foundations of the Trace Assertion Method of Module Interface Specification
, 2000
"... The trace assertion method is a formal state machine based method for specifying module interfaces. A module interface specification treats the module as a blackbox, identifying all module's ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
The trace assertion method is a formal state machine based method for specifying module interfaces. A module interface specification treats the module as a blackbox, identifying all module's
Periodic Orbits as the Skeleton of Classical and Quantum Chaos
 PROCEEDINGS OF THE LOS ALAMOS CENTER FOR NONLINEAR SCIENCE NONLINEAR SCIENCE  NEXT DECADE
, 1990
"... A description of a lowdimensional deterministic chaotic system in terms of unstable periodic orbits (cycles) is a powerful tool for theoretical and experimental analysis of both classical and quantum deterministic chaos, comparable to the familiar perturbation expansions for nearly integrable syste ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
A description of a lowdimensional deterministic chaotic system in terms of unstable periodic orbits (cycles) is a powerful tool for theoretical and experimental analysis of both classical and quantum deterministic chaos, comparable to the familiar perturbation expansions for nearly integrable systems. The infinity of orbits characteristic of a chaotic dynamical system can be resummed and brought to a Selberg product form, dominated by the short cycles, and the eigenvalue spectrum of operators associated with the dynamical flow can then be evaluated in terms of unstable periodic orbits. Methods for implementing this computation for finite subshift dynamics are introduced.
The simple dynamics of super Turing theories
, 1994
"... This paper reasons about the need to seek for particular kinds of models of computation that imply stronger computability than the classical models. A possible such model, constituting a chaotic dynamical system, is presented. This system, which we term as the analog shift map, when viewed as a comp ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
This paper reasons about the need to seek for particular kinds of models of computation that imply stronger computability than the classical models. A possible such model, constituting a chaotic dynamical system, is presented. This system, which we term as the analog shift map, when viewed as a computational model has superTuring power and is equivalent to neural networks and the class of analog machines. This map may be appropriate to describe idealized physical phenomena. 1.
On Monotonic Automata with a Restart Operation
, 1999
"... Automata with a restart operation de ne a special class of rewrite (reduction) systems which has a close relation to the dependency syntax of natural languages. We impose a natural condition of monotonocity and introduce a hierarchical structure of several versions of such automata. The language ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Automata with a restart operation de ne a special class of rewrite (reduction) systems which has a close relation to the dependency syntax of natural languages. We impose a natural condition of monotonocity and introduce a hierarchical structure of several versions of such automata. The language classes recognized by these automata form a proper hierarchy, with the class of contextfree languages on the top, and with the class of deterministic contextfree languages on the bottom. In particular, the deterministic monotonic versions of all the introduced automata recognize the same class of languages { namely that of deterministic contextfree languages.
Matching under side conditions in description logics
 Proc. of IJCAI01
, 2001
"... Whereas matching in Description Logics is now relatively wellinvestigated, there are only very few formal results on matching under additional side conditions, though these side conditions were already present in the original paper by Borgida and McGuinness introducing matching in DLs. The present ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Whereas matching in Description Logics is now relatively wellinvestigated, there are only very few formal results on matching under additional side conditions, though these side conditions were already present in the original paper by Borgida and McGuinness introducing matching in DLs. The present paper closes this gap for the DL ALN and its sublanguages: matching under subsumption conditions remains polynomial, while strict subsumption conditions increase the complexity to NP.
Conformance Tests for RealTime Systems with Timed Automata Specifications
"... A method is introduced for testing the conformance of implemented realtime systems to timed automata specifications. Uppaal timed automata are transformed into testable timed transition systems (TTTSs) using a test view. Fault hypotheses and a test generation algorithm for TTTSs are defined. Result ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
A method is introduced for testing the conformance of implemented realtime systems to timed automata specifications. Uppaal timed automata are transformed into testable timed transition systems (TTTSs) using a test view. Fault hypotheses and a test generation algorithm for TTTSs are defined. Results of applying the method are presented.
Towards robustness in parsing  fuzzifying contextfree language recognition
 Developments in Language Theory II  At the Crossroad of Mathematics, Computer Science and Biology
, 1996
"... We discuss the concept of robustness with respect to parsing or recognizing a contextfree language. Our approach is based on the notions of fuzzy language, (generalized) fuzzy contextfree grammar, and parser/recognizer for fuzzy languages. As concrete examples we consider a robust version of Cocke– ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
We discuss the concept of robustness with respect to parsing or recognizing a contextfree language. Our approach is based on the notions of fuzzy language, (generalized) fuzzy contextfree grammar, and parser/recognizer for fuzzy languages. As concrete examples we consider a robust version of Cocke–Younger–Kasami’s algorithm and a robust kind of recursive descent recognizer.
Classical AI Planning as Theorem Proving: The Case of a Fragment of Linear Logic
 In AAAI Fall Symposium on Automated Deduction in Nonstandard Logics
, 1993
"... This paper attempts to evaluate the use of a theorem prover in the multiplicative fragment of linear logic which has been shown to simulate conjunctive Stripslike planning [9]. A proof search procedure is presented that is correct, complete and only generates linear proofs (i.e. not trees). Plans t ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
This paper attempts to evaluate the use of a theorem prover in the multiplicative fragment of linear logic which has been shown to simulate conjunctive Stripslike planning [9]. A proof search procedure is presented that is correct, complete and only generates linear proofs (i.e. not trees). Plans that can be extracted from proofs are either totally or partially ordered. The procedure is tested against Stripslike planners and results are given. However, since linear logic is a resourcesensitive logic viewing formulas as data types, partial description of the final situation are impossible in linear logic; and shared postconditions are impossible in the fragment presented here. It is then argued that these restrictions eventually makes the presented fragment of linear logic, despite its formal framework, somewhat useless for practical planning purposes. 1 Introduction Framework The linear logic framework is that of [9] and table 1 gives its related sequent calculus. The classical St...