Results 1 - 10 of 4,045

Constraint propagation algorithms for temporal reasoning

by Marc Vilain, Henry Kautz, Peter Beek - Readings in Qualitative Reasoning about Physical Systems , 1986
"... Abstract: This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of intervalbased and point-based temporal representations. Computing the consequences of t ..."
Abstract - Cited by 428 (5 self) - Add to MetaCart
reasoning; of these, one of the most attractive is James Allen's algebra of temporal intervals [Allen 1983]. This representation scheme is particularly appealing for its simplicity and for its ease of implementation with constraint propagation algorithms. Reasoners based on

Constraint propagation

by Christian Bessiere - Handbook of Constraint Programming , 2006
"... Constraint propagation is a form of inference, not search, and as such is more ”satisfying”, both technically and aesthetically. —E.C. Freuder, 2005. Constraint reasoning involves various types of techniques to tackle the inherent ..."
Abstract - Cited by 76 (5 self) - Add to MetaCart
Constraint propagation is a form of inference, not search, and as such is more ”satisfying”, both technically and aesthetically. —E.C. Freuder, 2005. Constraint reasoning involves various types of techniques to tackle the inherent

The Essence of Constraint Propagation

by Krzysztof R. Apt - CWI QUARTERLY VOLUME 11 (2&3) 1998, PP. 215 { 248 , 1998
"... We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, Waltz, ltering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a simple abstract framework that allows us to classify and comp ..."
Abstract - Cited by 104 (6 self) - Add to MetaCart
We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, Waltz, ltering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a simple abstract framework that allows us to classify

Constraint Propagation

by A. Nait, Abdallah M. H. Emden
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Structural Disambiguation With Constraint Propagation

by Hiroshi Maruyama , 1990
"... We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto -word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite main so that efficient constraint-propagation algorit ..."
Abstract - Cited by 97 (1 self) - Add to MetaCart
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto -word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite main so that efficient constraint-propagation

Efficient constraint propagation engines

by Christian Schulte, Peter J. Stuckey - Transactions on Programming Languages and Systems
"... This paper presents a model and implementation techniques for speeding up constraint propagation. Three fundamental approaches to improving constraint propagation based on propagators as implementations of constraints are explored: keeping track of which propagators are at fixpoint, choosing which p ..."
Abstract - Cited by 62 (9 self) - Add to MetaCart
This paper presents a model and implementation techniques for speeding up constraint propagation. Three fundamental approaches to improving constraint propagation based on propagators as implementations of constraints are explored: keeping track of which propagators are at fixpoint, choosing which

Constraint propagation on quadratic constraints

by Ferenc Domes , et al. , 2008
"... This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after suitable preprocessing to arbitrary algebraic constraints. The basic new techniques consist in eliminating bilinear en ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after suitable preprocessing to arbitrary algebraic constraints. The basic new techniques consist in eliminating bilinear

Hybrid Representation Constraint Propagation

by Juan Flores - In In Proceedings of the Nineth International Symposium on Artificial Intelligence , 1996
"... Constraint propagation is an important inference engine for different AI applications that reason about quantities. Many systems [4, 6, 9, 14] represent the knowledge they reason about in terms of mathematical relations on qualitative or quantitative values of quantities, normally expressed as ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Constraint propagation is an important inference engine for different AI applications that reason about quantities. Many systems [4, 6, 9, 14] represent the knowledge they reason about in terms of mathematical relations on qualitative or quantitative values of quantities, normally expressed

Speeding up constraint propagation

by Christian Schulte, Peter J. Stuckey - In Wallace [14 , 2004
"... Abstract. This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keeping track of which propagators are at fixpoint, and choosing which propagator to apply next. We show how idempo ..."
Abstract - Cited by 28 (5 self) - Add to MetaCart
Abstract. This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keeping track of which propagators are at fixpoint, and choosing which propagator to apply next. We show how

Techniques for Efficient Constraint Propagation

by Mikael Z. Lagerkvist , 2008
"... This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental propagation, improved representation of constraints, and abstractions to simplify propagation. Support for incremental propagation is added to a propagator-centered propagation ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental propagation, improved representation of constraints, and abstractions to simplify propagation. Support for incremental propagation is added to a propagator
Results 1 - 10 of 4,045