Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
d Abstract) Sanjeev Arora∗ L´aszl´o Lov´asz† Ilan Newman‡ Yuval Rabani§ Yuri Rabinovich¶ Santosh Vempala Motivated by applications in combinatorial optimization, we ini...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...