Automatic decidability
C Lynch, B Morawska - … IEEE Symposium on Logic in Computer …, 2002 - ieeexplore.ieee.org
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002•ieeexplore.ieee.org
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 as the theory of lists, there are 0 (n/spl times/lg
(n)) clauses. For others it is polynomial. And for others it is simply exponential such as the …
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 as the theory of lists, there are 0 (n/spl times/lg
(n)) clauses. For others it is polynomial. And for others it is simply exponential such as the …
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 as the theory of lists, there are 0(n /spl times/ lg(n)) clauses. For others it is polynomial. And for others it is simply exponential such as the theory of (extensional) arrays.
ieeexplore.ieee.org
Showing the best result for this search. See all results