<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Theoretical computer science / Modular arithmetic / Logic in computer science / Congruence relation / Equivalence / Closure / Rewriting / Congruence lattice problem / Congruence subgroup
Date: 2005-02-02 07:20:48
Mathematics
Algebra
Theoretical computer science
Modular arithmetic
Logic in computer science
Congruence relation
Equivalence
Closure
Rewriting
Congruence lattice problem
Congruence subgroup

Proof-producing Congruence Closure Robert Nieuwenhuis? and Albert Oliveras?? Technical University of Catalonia, Jordi Girona 1, 08034 Barcelona, Spain www.lsi.upc.es/~roberto www.lsi.upc.es/~oliveras Abstract. Many appl

Add to Reading List

Source URL: www.lsi.upc.edu

Download Document from Source Website

File Size: 222,86 KB

Share Document on Facebook

Similar Documents

Process algebra and Markov processes The nature of synchronisation Equivalence relations Case study: active badges Summary  From Markov to Milner and back: Stochastic process algebras Jane Hillston School of Informatics

Process algebra and Markov processes The nature of synchronisation Equivalence relations Case study: active badges Summary From Markov to Milner and back: Stochastic process algebras Jane Hillston School of Informatics

DocID: 1xVg5 - View Document

FEVS: A Functional Equivalence Verification Suite Stephen F. Siegel, Timothy K. Zirkel, Yi Wei Supported by the National Science Foundation under Grant No. CCF

FEVS: A Functional Equivalence Verification Suite Stephen F. Siegel, Timothy K. Zirkel, Yi Wei Supported by the National Science Foundation under Grant No. CCF

DocID: 1xUHu - View Document

Verifying the Floating-Point Computation Equivalence of Manually and Automatically Differentiated Code — 1st International Workshop on Software Correctness for HPC Applications, Nov 12, 2017, CO, USA

Verifying the Floating-Point Computation Equivalence of Manually and Automatically Differentiated Code — 1st International Workshop on Software Correctness for HPC Applications, Nov 12, 2017, CO, USA

DocID: 1xUlS - View Document

Language Equivalence of Probabilistic Pushdown Automata Vojtˇech Forejta , Petr Janˇcarb , Stefan Kiefera , James Worrella a Department b Dept

Language Equivalence of Probabilistic Pushdown Automata Vojtˇech Forejta , Petr Janˇcarb , Stefan Kiefera , James Worrella a Department b Dept

DocID: 1xUlb - View Document

Semantic Security Invariance under Variant Computational Assumptions Eftychios Theodorakis? and John C. Mitchell?? Abstract. A game-based cryptographic proof is a relation that establishes equivalence between probabilist

Semantic Security Invariance under Variant Computational Assumptions Eftychios Theodorakis? and John C. Mitchell?? Abstract. A game-based cryptographic proof is a relation that establishes equivalence between probabilist

DocID: 1xTmW - View Document