through suitable abstractions and tools is a viable option for improving servicebased computations. T he past few years have witnessed end users' increasing involve ment in th...
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...
Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Nau...
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...