Sciweavers

700 search results - page 73 / 140
» On Termination of Constraint Logic Programs
Sort
View
PPDP
2004
Springer
15 years 4 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
AUTOMATICA
2005
115views more  AUTOMATICA 2005»
14 years 11 months ago
Robust constrained predictive control using comparison model
This paper proposes a quadratic programming (QP) approach to robust model predictive control (MPC) for constrained linear systems having both model uncertainties and bounded distu...
Hiroaki Fukushima, Robert R. Bitmead
SAC
2009
ACM
15 years 6 months ago
Length-lex bound consistency for knapsack constraints
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
Justin Yip, Pascal Van Hentenryck
IPPS
2000
IEEE
15 years 3 months ago
Declarative Concurrency in Java
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. The language allows the programmer to declaratively...
Rafael Ramirez, Andrew E. Santosa
LPNMR
2005
Springer
15 years 4 months ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris