One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of EhrenfeuchtF...
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
nlp is a compiler for nested logic programming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets ...
Vladimir Sarsakov, Torsten Schaub, Hans Tompits, S...
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...