Decidability and Complexity Analysis by Basic Paramodulation

Information and Computation

Volumn 147, Issue 1, 1998, Pages 1-21

  Nieuwenhuis, Robert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012520250     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2730     Document Type: Article

References (19)

1. Bachmair, L., and Ganzinger, H. (1994), Rewrite-based equational theorem proving with selection and simplification, J. Logic Computation 4(3), 217-247.
2. Bachmair, L., Ganzinger, H., Lynch, C., and Snyder, W. (1995), Basic paramodulation, Inform. Comput. 121(2), 172-192.
3. Bachmair, L. Ganzinger, H., and Waldmann, U. (1993a), Set constraints are the monadic class, in "Eight Annual IEEE Symposium on Logic in Computer Science," pp. 75-83, IEEE Computer Society Press, Montreal, Canada.
4. Bachmair, L. Ganzinger, H., and Waldmann, U. (1993b), Superposition with simplification as a decision procedure for the monadic class with equality, in "3rd Kurt Gödel Colloquium: Computational Logic and Proof Theory," LNCS 713, pp. 83-96, Springer-Verlag, Berlin.
5. Christian, J. (1992), Some termination criteria for narrowing and E-narrowing, in "11th International Conference on Automated Deduction" (D. Kapur, Ed.), LNAI 607, pp. 582-588, Springer-Verlag, Saratoga Springs, New York.
6. Comon, H., Haberstrau, M., and Jouannaud, J.-P. (1994), Syntacticness, cycle-syntacticness and shallow theories, Inform. Comput. 111(1), 154-191.
7. Dershowitz, N. (1987), Termination of rewriting, J. Symbolic Comput. 3, 69-116.
8. Dershowitz, N., and Jouannaud, J.-P. (1990), Rewrite systems, in "Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics" (J. Van Leeuwen, Ed.), Chap. 6, pp. 244-320, Elsevier Science, Amsterdam.
9. Domenjoud, E. (1993), Shallow AC theories, in "Abstracts of the CCL Workshop," La Escala, Spain [Also INRIA Nancy (France) research report.].
10. Fermüller, C., and Salzer, G. (1993), Ordered paramodulation and resolution as a decision procedure, in "Logic Programming and Automated Reasoning, Int. Conf." (A. Voronkov, Ed.), LNAI 698, pp. 122-133, Springer-Verlag, Berlin.
11. Kirchner, C. (1986), Computing unification algorithms, in "1st IEEE Symposium on Logic in Computer Science," pp. 206-216, Cambridge, MA.
12. Kirchner, C., Kirchner, H., and Rusinowitch, M. (1990), Deduction with symbolic constraints, Revue Française d'Intelligence Artificielle 4(3), 9-52.
13. Marché, C. (1991), On ground AC-completion, in "Rewriting Techniques and Applications, 4th International Conference" (R. V. Book, Ed.), LNCS 488, pp. 411-422, Springer-Verlag, Como, Italy.
14. Marche, C. (1994), Normalised rewriting and normalised completion, in "Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France," IEEE Computer Society Press, Los Alamitos, CA.
15. Narendran, P., and Rusinowitch, M. (1991), Any ground associative commutative theory has a finite canonical system, in "Fourth Int. Conf. on Rewriting Techniques and Applications," LNCS 488, pp. 423-434, Springer-Verlag, Como, Italy.
16. Narendran, P., and Rusinowitch, M. (1993), The unifiability problem in ground AC theories, in "Eight Annual IEEE Symposium on Logic in Computer Science," IEEE Computer Society Press, Montreal, Canada.
17. Nieuwenhuis, R. (1995), On narrowing, refutation proofs and constraints, in "6th International Conference on Rewriting Techniques and Applications" (J. Hsiang, Ed.), LNCS 914, pp. 56-70, Springer-Verlag, Kaiserlautern, Germany.
18. Nieuwenhuis, R., and Rubio, A. (1995), Theorem proving with ordering and equality constrained clauses, J. Symbolic Computation 19(4), 321-351.
19. Oyamaguchi, M. (1990), On the word problem for right-ground term-rewriting systems, Trans. IEICE 73(5), 718-723.