Stratified resolution
Data(s) |
2003
|
---|---|
Resumo |
We introduce a calculus of stratified resolution, in which special attention is paid to clauses that "define" relations. If such clauses are discovered in the initial set of clauses, they are treated using the rule of definition unfolding, i.e. the rule that replaces defined relations by their definitions. Stratified resolution comes with a powerful notion of redundancy: a clause to which definition unfolding has been applied can be removed from the search space. To prove the completeness of stratified resolution with redundancies, we use a novel combination of Bachmair and Ganzingerâ??s model construction technique and a hierarchical construction of orderings and least fixpoints. |
Formato |
application/pdf |
Identificador |
http://calcium.dcs.kcl.ac.uk/882/1/jsc03.pdf Degtyarev, Anatoli and Nieuwenhuis, Robert and Voronkov, Andrei (2003) Stratified resolution. Journal of Symbolic Computation, 36 (1-2). pp. 79-99. |
Relação |
http://calcium.dcs.kcl.ac.uk/882/ |
Tipo |
Article PeerReviewed |