H. Khanh Hoang

Learn More
In this paper, symmetry-based choice mechanisms are exploited to compute deterministic queries. We investigate a particular form of these choice mechanisms, called specified symmetry choice. This mechanism is efficient (i.e. computable in polynomial time) and can be added to Fixpoint Logic to give a language that is more powerful than the extension of(More)
It is well-known that in the presence of an order on the database domain the class DB-Ptime of the (deterministic) queries that are computable in polynomial time is exactly captured by the family of the Fixpoint Queries. However in the general case the existence of a language which exactly captures the DB-Ptime class remains still open.The introduction of(More)
  • 1