1763 search results - page 215 / 353 » A Formalization of Polytime Functions |
AMAI
2007
Springer
14 years 10 months ago
2007
Springer
Abstract In many scenarios, a database instance violates a given set of integrity constraints. In such cases, it is often required to repair the database, that is, to restore its c...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is mo...
106
click to vote
CONSTRAINTS
2008
14 years 10 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
ENTCS
2008
14 years 10 months ago
2008
Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional lan...