Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...
Abstract. We provide an interactive method for knowledge acquisition combining approaches from description logic and formal concept analysis. Based on present data, hypothetical ru...