For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
A number of communication libraries have been written to support concurrent programming. For a variety of reasons, these libraries generally are not well-suited for use in undergr...
Steve Carr, Changpeng Fang, Tim Jozwowski, Jean Ma...
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...