Sciweavers

303 search results - page 37 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
LPAR
2005
Springer
15 years 3 months ago
Automating Coherent Logic
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...
Marc Bezem, Thierry Coquand
DM
2002
105views more  DM 2002»
14 years 9 months ago
Research problems
This paper provides an overview of methods and systems developed for record linkage. Modern record linkage begins with the pioneering work of Newcombe and is especially based on t...
IJAC
2010
231views more  IJAC 2010»
14 years 7 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
DAGSTUHL
2006
14 years 11 months ago
Enriched categories and models for spaces of dipaths
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
Timothy Porter
SAFECOMP
2000
Springer
15 years 1 months ago
Assessment of the Reliability of Fault-Tolerant Software: A Bayesian Approach
Fault tolerant systems based on the use of software design diversity may be able to achieve high levels of reliability more cost-effectively than other approaches, such as heroic ...
Bev Littlewood, Peter T. Popov, Lorenzo Strigini