XML data can be naturally modeled as a graph. Existing query languages to XML can only express queries of matching XML document with a tree-structured schema with structural and value constraints without the consideration of graph features. The ability of such query languages cannot satisfy various requirements of querying graph-structured XML data. In this paper, GXQuery is presented as an ext...

This article contains a proposal for an automatic in-image face detection method, that tries to join several theories, which many authors wrote of before. The method assumes certain circumstances and constraints, respectively. Just because of such constraints it is not applicable universally. Thus, it’s not suitable for a starting-point of a more flexible method. On the other hand, however, it ...

Many important applications, e.g. planning tasks, demand the flexible and efficient use of personalization and preference handling techniques. Applying preference-based search technology could improve things quite a lot, e.g. using Preference SQLwhere preferences (i.e. soft constraints) can be combined with hard constraints. However, there are still fundamental efficiency issues that need to be...

We propose a framework for solving equational and membership constraints for terms built over individual, sequence, function, and context variables and flexible arity symbols. Each membership constraint couples a variable with a regular expression on terms or contexts. There can be several membership constraints with the same constrained variable, and expressions may contain variables themselve...

This paper describes an intuitive and efficient way to design not only 3-D shapes but also their geometric constraints within an immersive modeler. The fundamental concept of the proposed method is based on our immersive modeler VLEGO II, which allows multiple users to create 3-D virtual objects only by assembling simple 3-D geometric shapes (shape primitives) like with real toy blocks. In our ...

An algorithm is proposed to equivalently transform original linear constraints on Petri nets, where the uncontrollable subnets are forward-concurrent free nets, into admissible ones. Consequently, this algorithm can be used to design both efficient and optimal supervisors for enforcing linear constraints on Petri nets since the problem on how to enforce admissible constraints has been well solv...

This paper presents an approach for the representation and handling of soft temporal constraints in a planning framework. It is achieved in two steps. The first one is the representation of soft temporal constraints by means of fuzzy subsets of a real timeline. And the second one is the successful integration of the temporal reasoning capabilities of a scheduler able to handle these constraints...

Declarative programming languages base on the idea that programs should be as close as possible to the problem specification and domain. Programs of these languages usually consist of directly formulated mathematical objects, i.e. relations and functions. Accordingly, declarative languages are distinguished into logic, functional, functional-logic, and constraint programming languages. Even if ...

Practical problems often combine real-world hard constraints with soft constraints involving preferences, uncertainties or flexible requirements. A probability distribution over the models that meet the hard constraints is an answer to such problems that is in the spirit of incorporating soft constraints. We propose a method using SAT-based reasoning, probabilistic reasoning and linear programm...