Sciweavers

1557 search results - page 38 / 312
» Programming up to Congruence
Sort
View
ICALP
2007
Springer
15 years 5 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
15 years 3 months ago
Translating Out of Static Single Assignment Form
Programs represented in Static Single Assignment (SSA) form contain phi instructions (or functions) whose operational semantics are to merge values coming from distinct control flo...
Vugranam C. Sreedhar, Roy Dz-Ching Ju, David M. Gi...
SIGSOFT
2002
ACM
15 years 11 months ago
Isolating cause-effect chains from computer programs
Consider the execution of a failing program as a sequence of program states. Each state induces the following state, up to the failure. Which variables and values of a program sta...
Andreas Zeller
LOPSTR
1997
Springer
15 years 3 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen
AROBOTS
2004
99views more  AROBOTS 2004»
14 years 10 months ago
Bayesian Robot Programming
We propose a new method to program robots based on Bayesian inference and learning. It is called BRP for Bayesian Robot Programming. The capacities of this programming method are d...
Olivier Lebeltel, Pierre Bessière, Julien D...