61 search results - page 3 / 13 » Tableau Methods for PA-Processes |
IJCAI
1997
13 years 8 months ago
1997
We study complexity of methods using rigid variables, like the method of matings or the tableau method, on a decidable class of predicate calculus with equality. We show some intr...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...
ENTCS
2010
13 years 7 months ago
2010
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
CL
2000
Springer
13 years 11 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...