On ordering constraints for deduction with built-in abelian semigroups, monoids and groups

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 38-47

  Godoy, G ^a   Nieuwenhuis, R ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Automated deduction; Symbolic constraints; Term orderings

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; SEMANTICS; THEOREM PROVING;

AUTOMATED DEDUCTION; SYMBOLIC CONSTRAINT; TERM ORDERINGS;

COMPUTABILITY AND DECIDABILITY;

EID: 0034865563     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Termination orderings for associative-commutative rewriting systems
2. Solving symbolic ordering constraints
3. Orderings, AC-theories and symbolic constraint solving
4. Orderings for term-rewriting systems
5. Rewrite systems
6. Paramodulation with built-in abelian groups
7. Satisfiability of systems of ordinal notations with the subterm property is decidable
8. Deduction with symbolic constraints
9. A decision procedure for the existential theory of term algebras with the knuth-bendix ordering
10. Solution of the Robbins problem
11. RPO constraint solving is in NP
12. Simple LPO constraint solving methods
13. Theorem proving with ordering and equality constrained clauses
14. Paramodulation with built-in AC-theories and symbolic constraints
15. Paramodulation-based theorem proving
16. A total AC-compatible ordering based on RPO
17. Associative commutative deduction with constraints