Sciweavers

510 search results - page 64 / 102
» An Algebraic Framework for Urgency
Sort
View
IJCAI
2003
15 years 7 months ago
Incremental Tractable Reasoning about Qualitative Temporal Constraints
In many applications of temporal reasoning we are in­ terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
Alfonso Gerevini
AML
2010
96views more  AML 2010»
15 years 6 months ago
Implicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
Petr Cintula, Carles Noguera
CORR
2008
Springer
140views Education» more  CORR 2008»
15 years 6 months ago
A Cloning Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
Dominique Duval, Rachid Echahed, Fréd&eacut...
LISP
2006
105views more  LISP 2006»
15 years 6 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 4 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger