1 resultado para Race relations.
em Massachusetts Institute of Technology
Filtro por publicador
- Repository Napier (2)
- Aberystwyth University Repository - Reino Unido (13)
- Aquatic Commons (12)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (4)
- Biblioteca Digital da Câmara dos Deputados (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (12)
- Blue Tiger Commons - Lincoln University - USA (1)
- Boston College Law School, Boston College (BC), United States (2)
- Boston University Digital Common (2)
- Brock University, Canada (41)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (23)
- CentAUR: Central Archive University of Reading - UK (1)
- Center for Jewish History Digital Collections (2)
- Central European University - Research Support Scheme (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (15)
- Cochin University of Science & Technology (CUSAT), India (4)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Cornell: DigitalCommons@ILR (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons @ Winthrop University (5)
- Digital Commons at Florida International University (10)
- Digital Howard @ Howard University | Howard University Research (8)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (2)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (8)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (6)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (44)
- Greenwich Academic Literature Archive - UK (1)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (15)
- Indian Institute of Science - Bangalore - Índia (52)
- Infoteca EMBRAPA (1)
- Instituto Politécnico do Porto, Portugal (2)
- Massachusetts Institute of Technology (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (9)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (240)
- Queensland University of Technology - ePrints Archive (189)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (5)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositorio Institucional de la Universidad Pública de Navarra - Espanha (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (5)
- Research Open Access Repository of the University of East London. (6)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (2)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad Autónoma de Nuevo León, Mexico (4)
- Universidad del Rosario, Colombia (2)
- Universidade de Lisboa - Repositório Aberto (6)
- Universidade Federal do Pará (3)
- Universidade Metodista de São Paulo (1)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (135)
- University of Connecticut - USA (1)
- University of Michigan (15)
- University of Queensland eSpace - Australia (11)
- University of Washington (3)
- WestminsterResearch - UK (9)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable tractable rule sets can be precisely characterized. A series of examples of rule sets whose tractability is non-trivial, yet machine recognizable, is also given. The technical framework developed here is viewed as a first step toward a general theory of tractable inference relations.