This paper presents a framework of query translation based on ontology between different query interfaces (forms), which will translate the queries into suitable formats, hiding the differences from underlying sources, and enabling users to access data sources conveniently. Firstly, constructing domain ontology concept model (DOCM), then, finding out predicate matching relationships between sou...

It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems (which compute normal forms of input terms) and consider the case where individual systems share constructors, but not de ned symbols. We present some old and new su cient conditions under which termination (existence of normal forms, regardless of comput...

Term rewriting proved to be a simple, uniform and powerful computational paradigm. Rewrite rules independently match and apply anywhere, unconstrained by the context. Rewriting is particularly appealing for defining truly concurrent systems, since rewrite rules can apply in parallel. Unfortunately, there is an inherent impediment in using term rewriting for defining concurrent systems or progra...

This work reports on the implementation of a two-dimensional, varia-tional geometric constraint solver based on a constructive approach. The solver computes a solution in two phases. First, using rewrite rules, the solver builds a sequence of construction steps. Then, the construction steps are carried out to generate an instance of the geometric object for the current dimension values. We disc...

Organizations typically define policies to describe (positive or negative) requirements about strategic objectives. Examples are policies relative to the security of information systems in general or to the control of access to an organization’s resources. Often, the form used to specify policies is in terms of general constraints (what and why) to be enforced via the use of rules (how and when...

I prove that there are phonological patterns which are expressible by ordered rewrite rules but not by any Optimality Theoretic (OT) grammar whose constraint set contains only markedness constraints and single–state faithfulness constraints, i.e. faithfulness constraints that assign violation marks to pairs of single input–output segments in correspondence, with no reference to other segments i...

We are interested in constraint manipulation using rule-based algorithms because of the explicit distinction made in this approach between deduction rules and control. We associate actions with rewrite rules and control with strategies that establish the order of application of the inferences. This framework allows us to describe constraint handling in a very abstract way, prototype new heurist...