We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
Abstract. In the future it is likely that peer communities will be routinely established for the purpose of sharing electronic resources and targeted information among groups of pe...
Every interactive system has a functional part and an interactive part. However the software engineering and the human-computer-interaction communities work separately in terms of ...
Eric Ceret, Sophie Dupuy-Chessa, Guillaume Godet-B...
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
Toufiq Parag, Claus Bahlmann, Vinay D. Shet, Manee...