Results 311 to 320 of about 5,329,946 (348)
Some of the next articles are maybe not open access.
Abstracting Constraints Using Constraints
2003Abstraction is a process where problems are modified in some way to make them easier to solve. For our purposes, we look at abstraction as adding constraints in such a manner as to reduce the number of solutions, or removing constraints in order to make more solutions valid. It is a form of simplification, where certain details of a problem are ignored,
openaire +1 more source
Grammars, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Constraint propagation for loose constraint graphs
Proceedings of the 2007 ACM symposium on Applied computing, 2007In this paper we investigate how to improve propagation-based finite domain constraint solving by making use of the constraint graph to choose propagators to execute in a better order. If the constraint graph is not too densely connected we can build an underlying tree of bi-connected components, and use this to order the choice of propagator.
Kathryn Francis, Peter J. Stuckey
openaire +1 more source
Constraints on violating constraints
Pragmatics and Society, 2014This paper examines the contradictory demands of using language expressively and still qualifying as language, proposing a functional explanation for the form of words in a linguistic word category. Being expressive requires expending more energy, emitting a more robust signal to convey additional information about the speaker, the perception of an ...
openaire +1 more source
Reformulation of Global Constraints Based on Constraints Checkers
Constraints, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Beldiceanu +3 more
openaire +2 more sources
Box Constraint Collections for Adhoc Constraints
2003In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation achieves domain consistency. We develop an algorithm to automatically generate a box constraint collection for a given adhoc constraint. The result is guaranteed to be complete
Chi Kan Cheng +2 more
openaire +1 more source
1999
Disunification is the problem of deciding satisfiability of a system of equations and disequations w.r.t. a given equational theory. In this paper we study the disunification problem in the context of ACI1 equational theories. We provide a characterization of the interpretation structures suitable to model the axioms in ACI1 theories.
DOVIER, Agostino +3 more
openaire +1 more source
Disunification is the problem of deciding satisfiability of a system of equations and disequations w.r.t. a given equational theory. In this paper we study the disunification problem in the context of ACI1 equational theories. We provide a characterization of the interpretation structures suitable to model the axioms in ACI1 theories.
DOVIER, Agostino +3 more
openaire +1 more source
Taking Constraints out of Constraint Databases
2004By providing a finite representation for data with infinite semantics, the Constraint Database approach is particularly appropriate for querying spatiotemporal data. Since the introduction of CDBs in the early 1990’s, several CDB prototypes have been implemented; however, CDBs have yet to prove their commercial viability.
openaire +1 more source
Constraints with Variables’ Annotations and Constraint Hierarchies
1998Variables' annotations in over-constrained problems enable to express preferences for optimal solution selection using preferences on variables. The basic interpretation of variables' annotations is presented and correspondence with hierarchical CSP is described. New local comparator for constraint hierarchy is proposed and used for solving constraints
openaire +1 more source