We give a set of inference rules with constant constraints. Then we show how to extend a set of equational clauses, so that if the application of these inference rules halts on these clauses, then the theory is decidable by applying a standard set of Paramodulation inference rules. In addition, we can determine the number of clauses generated in this decision procedure. For some theories, such ...

In this paper we use the tableau as a means to prove decidability of weak bisimulation for normed BPA. Decidability was proved for a restricted subclass, the totally normed processes by Hirshfeld [9]. However in the case that weak bisimilarity to be decidable is inequivalence is finitely approximable. In this paper we relax restriction of totally normedness and prove decidability of weak bisimi...

This is a survey of some decidability results for Petri nets, covering the last three decades. The presentation is structured around decidability of specific properties, various behavioural equivalences and finally the model checking problem for temporal logics.

We consider decidability questions for simulation preorder (and equivalence) for processes generated by one-counter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstrate the undecidability in the general case.

This paper establishes the decidability of typechecking in Fω ∧ , a typed lambda calculus combining higher-order polymorphism, subtyping, and intersection types. It contains the first proof of decidability of subtyping for a higher-order system.

Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. For particular, restricted concrete domains decidablity can be regained. We introduce a novel way to integrate a concrete domain D into the well-known description logic ALC, we call the resulting logic ALC(D). We then identify sufficient conditions on D that guarantee decidability of the...