3228 search results - page 39 / 646 » Computationally Sound Proofs |
HEURISTICS
2006
13 years 7 months ago
2006
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
STACS
2001
Springer
14 years 1 hour ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
ASM
2005
ASM
14 years 1 months ago
2005
ASM
AsmL is a novel executable specification language based on the theory of State Machines (ASMs). It represents one of the most powerful practical engines to write and execute ASMs...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
SIGCSE
1997
ACM
13 years 11 months ago
1997
ACM
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...