<--- 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

JMLR: Workshop and Conference Proceedings vol 40:1–12, 2015  Learnability of Solutions to Conjunctive Queries: The Full Dichotomy Hubie Chen

JMLR: Workshop and Conference Proceedings vol 40:1–12, 2015 Learnability of Solutions to Conjunctive Queries: The Full Dichotomy Hubie Chen

DocID: 1oX9o - View Document

Characterizing algebras and varieties by weak congruence lattices and open problems ˇ selja Andreja Tepavˇcevi´c and Branimir Seˇ Department of Mathematics and Informatics, Faculty of Sciences

Characterizing algebras and varieties by weak congruence lattices and open problems ˇ selja Andreja Tepavˇcevi´c and Branimir Seˇ Department of Mathematics and Informatics, Faculty of Sciences

DocID: 1n86w - View Document

Shimura varieties and moduli J.S. Milne Abstract. Connected Shimura varieties are the quotients of hermitian symmetric domains by discrete groups defined by congruence conditions. We examine their relation with moduli va

Shimura varieties and moduli J.S. Milne Abstract. Connected Shimura varieties are the quotients of hermitian symmetric domains by discrete groups defined by congruence conditions. We examine their relation with moduli va

DocID: 1kQM7 - View Document

BRICS DS-04-1 B. Klin: An Abstract Coalgebraic Approach to Process Equivalence for Well-Behaved Operational Semantics BRICS  Basic Research in Computer Science

BRICS DS-04-1 B. Klin: An Abstract Coalgebraic Approach to Process Equivalence for Well-Behaved Operational Semantics BRICS Basic Research in Computer Science

DocID: 1fMyZ - View Document

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and shar

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and shar

DocID: 1aVlg - View Document