Results 281 to 290 of about 1,744,639 (315)
Some of the next articles are maybe not open access.
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
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
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
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
A Synthesis of Constraint Satisfaction and Constraint Solving
2003This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspired some constraint programming languages, it has some weaknesses that leave it not directly applicable to the study of complex constraints (including so-called global constraints) in ...
openaire +1 more source
Inferring Constraint Types in Constraint Programming
2002Capturing constraint structure is critical in Constraint Programming to support the configuration and adaptation of domain filtering algorithms. To this end, we propose a software model coupling a relational constraint language, a constraint type inference system, and an algorithm configuration system.
openaire +1 more source
Demand for green finance: Resolving financing constraints on green innovation in China
Energy Policy, 2021Chin-Hsien Yu +2 more
exaly