Sciweavers

1353 search results - page 32 / 271
» Streamlined Constraint Reasoning
Sort
View
CSL
2006
Springer
13 years 11 months ago
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
Manuel Bodirsky, Hubie Chen
AIIA
2005
Springer
13 years 9 months ago
Periodicity-Based Temporal Constraints
We propose a framework for performing extensional and intensional temporal reasoning about qualitative and quantitative “periodicity-dependent” temporal constraints between rep...
Paolo Terenziani, Luca Anselma, Stefania Montani
ISSAC
2001
Springer
101views Mathematics» more  ISSAC 2001»
14 years 6 days ago
Maple's evaluation process as constraint contextual rewriting
Maple’s evaluator, together with a feature that is usually known as the assume facility, is a combination of modules with specialised reasoning capabilities. These modules are i...
Alessandro Armando, Clemens Ballarin
AI
2001
Springer
13 years 11 months ago
Learning about Constraints by Reflection
A system's constraints characterizes what that system can do. However, a dynamic environment may require that a system alter its constraints. If feedback about a specific situ...
J. William Murdock, Ashok K. Goel
LPAR
2005
Springer
14 years 1 months ago
Disjunctive Constraint Lambda Calculi
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...
Matthias M. Hölzl, John N. Crossley