Laurent Vigneron  Home/Search
Context Related
| loria.fr/pub/loria...neronCADE94.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math.ju...ftp.loria.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Associative-commutative equational reasoning is known to be highly complex for theorem proving. Hence, it is very important to focus deduction by adding constraints, such as unification and ordering, and to define efficient strategies, such as the basic requirements `a la Hullot. Constraints are formulas used for pruning the set of ground instances of clauses deduced by a theorem prover. We propose here an extension of AC-paramodulation and AC-superposition with these constraint mechanisms... (Update)
Similar documents based on text: More All
0.2: Automated Deduction with Associative Commutative Operators - Rusinowitch, Vigneron (1993) (Correct)
0.1: D'eduction Dans Des Th'eories 'equationnelles Avec Contraintes.. - Vigneron (1994) (Correct)
0.1: Positive Deduction modulo Regular Theories - Vigneron (1995) (Correct)
BibTeX entry: (Update)
L. Vigneron, 1994. Associative-commutative deduction with constraints. Proc. 12th Int. Conf. on Automated Deduction, Saratoga Springs, NY, LNCS 814, pp. 530--544. Springer. http://citeseer.ist.psu.edu/vigneron93associativecommutative.html More
@inproceedings{ vigneron94associativecommutative,
author = "Laurent Vigneron",
title = "Associative-Commutative Deduction with Constraints",
booktitle = "Conference on Automated Deduction",
pages = "530-544",
year = "1994",
url = "citeseer.ist.psu.edu/vigneron93associativecommutative.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
125 Solving equations in abstract algebras: a rule-based survey .. (context) - Jouannaud, Kirchner - 1991
114 Building-in equational theories (context) - Plotkin - 1972
103 Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
74 Basic paramodulation and superposition (context) - Bachmair, Ganzinger et al. - 1992
65 Automated theorem-proving for theories with simplifiers (context) - Slagle - 1974
64 Basic superposition is complete (context) - Nieuwenhuis, Rubio - 1992
59 On restrictions of ordered paramodulation with simplificatio.. (context) - Bachmair, Ganzinger - 1990
58 Deduction with symbolic constraints (context) - Kirchner, Kirchner et al. - 1990
55 Theorem proving with ordering constrained clauses (context) - Nieuwenhuis, Rubio - 1992
45 Proving refutational completeness of theorem-proving strateg.. (context) - Hsiang, Rusinowitch - 1991
41 A precedence-based total ac-compatible ordering (context) - Rubio, Nieuwenhuis - 1993
37 Proving theorems with the modification method (context) - Brand - 1975
34 Any ground associative-commutative theory has a finite canon.. - Narendran, Rusinowitch - 1991
34 A technique for establishing completeness results in theorem.. (context) - Peterson - 1983
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.loria.fr.html): More
Towards a General Signal Interpretation System -.. - Gong, Haton (Correct)
Description of Specification Developments - Souquières, al. (Correct)
Termination Proofs using gpo Ordering Constraints - Genet, Gnaedig (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC