Relevant bibliographies by topics / Consistency constraints

Academic literature on the topic 'Consistency constraints'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Consistency constraints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Consistency constraints"

1

Nagarajan, S., S. D. Goodwin, and A. Sattar. "Extending Dual Arc Consistency." International Journal of Pattern Recognition and Artificial Intelligence 17, no. 05 (August 2003): 781–815. http://dx.doi.org/10.1142/s0218001403002654.

Full text
Abstract:
Many extensions to existing binary constraint satisfaction algorithms have been proposed that directly deal with nonbinary constraints. Another choice is to perform a structural transformation of the representation of the problem, so that the resulting problem is a binary CSP except that now the original constraints which were nonbinary are replaced by binary compatibility constraints between relations. A lot of recent work has focussed on comparing different levels of local consistency enforceable in the nonbinary representation with the dual representation. In this paper we present extensions to the standard dual encoding that can compactly represent the given CSP using an equivalent dual encoding that contains all the original solutions to the CSP, using constraint coverings. We show how enforcing arc consistency in these constraint covering based encodings, strictly dominates enforcement of generalized arc consistency (GAC) on the primal nonbinary encoding.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Y., and R. H. C. Yap. "Set Intersection and Consistency in Constraint Networks." Journal of Artificial Intelligence Research 27 (December 13, 2006): 441–64. http://dx.doi.org/10.1613/jair.2058.

Full text
Abstract:
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This approach not only simplifies the understanding of and unifies many existing consistency results, but also directs the study of consistency to that of set intersection properties in many situations, as demonstrated by the results on the convexity and tightness of constraints in this paper. Specifically, we identify a new class of tree convex constraints where local consistency ensures global consistency. This generalizes row convex constraints. Various consistency results are also obtained on constraint networks where only some, in contrast to all in the existing work,constraints are tight.
APA, Harvard, Vancouver, ISO, and other styles
3

Jeavons, Peter, David Cohen, and Martin C. Cooper. "Constraints, consistency and closure." Artificial Intelligence 101, no. 1-2 (May 1998): 251–65. http://dx.doi.org/10.1016/s0004-3702(98)00022-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lecoutre, Christophe, Anastasia Paparrizou, and Kostas Stergiou. "Extending STR to a Higher-Order Consistency." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 576–82. http://dx.doi.org/10.1609/aaai.v27i1.8622.

Full text
Abstract:
One of the most widely studied classes of constraints in constraint programming (CP) is that of table constraints. Numerousspecialized filtering algorithms, enforcing the wellknown property called generalized arc consistency (GAC),have been developed for such constraints. Among the most successful GAC algorithms for table constraints, we find variants of simple tabular reduction (STR), like STR2. In this paper,we propose an extension of STR-based algorithms that achieves full pairwise consistency (FPWC), a consistency stronger than GAC and max restricted pairwise consistency (maxRPWC). Our approach involves counting the number of occurrences of specific combinations of values in constraint intersections. Importantly, the worst-case time complexity of one call to the basic filtering procedure at the heart of our new algorithm is quite close to that of STR algorithms. Experiments demonstrate that our method can outperform STR2 in many classes of problems, being significantly faster in some cases. Also, it is clearly superior to maxRPWC+, an algorithm that has been recently proposed.
APA, Harvard, Vancouver, ISO, and other styles
5

Paparrizou, Anastasia, and Kostas Stergiou. "An Efficient Higher-Order Consistency Algorithm for Table Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 535–41. http://dx.doi.org/10.1609/aaai.v26i1.8135.

Full text
Abstract:
Table constraints are very important in constraint programming as they are present in many real problems from areas such as configuration and databases. As a result, numerous specialized algorithms that achieve generalized arc consistency (GAC) on table constraints have been proposed. Since these algorithms achieve GAC, they operate on one constraint at a time. In this paper we propose an efficient algorithm for table constraints that achieves a stronger local consistency than GAC. This algorithm, called maxRPWC+, is based on the local consistency maxRPWC and allows the efficient handling of intersecting table constraints. Experimental results from benchmark problems demonstrate that maxRPWC+ is clearly more robust than a state-of-the-art GAC algorithm in classes of problems with interleaved table constraints, being orders of magnitude faster in some of these classes.
APA, Harvard, Vancouver, ISO, and other styles
6

Bordeaux, Lucas, Marco Cadoli, and Toni Mancini. "Generalizing consistency and other constraint properties to quantified constraints." ACM Transactions on Computational Logic 10, no. 3 (April 2009): 1–25. http://dx.doi.org/10.1145/1507244.1507247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

LIU, BING. "SPECIFIC CONSTRAINT HANDLING IN CONSTRAINT SATISFACTION PROBLEMS." International Journal on Artificial Intelligence Tools 03, no. 01 (March 1994): 79–96. http://dx.doi.org/10.1142/s0218213094000066.

Full text
Abstract:
Abundant literatures exist on consistency techniques for solving Constraint Satisfaction Problems (CSPs). These literatures, however, focused mainly on finding efficient general techniques to achieve network consistency and to solve CSPs. So far, many techniques have been reported, e.g., node consistency, arc consistency, path consistency, k-consistency, forward checking, lookahead, partial lookahead, etc. Not enough attention has been given to individual constraints, and how constraint specific features may be exploited for more efficient consistency check. Many types of constraints exist in real problems, and each has its own features. These features may allow specific consistency techniques to be designed such that they are more efficient than the general algorithms. To analyze this issue, we divide a consistency algorithm into three parts: (1) activating constraints for check; (2) selecting the next constraint to be checked; and (3) checking the selected constraint. We will discuss how constraint specific features may influence each of these aspects and how special handling techniques may be designed to improve the efficiency. In order to allow these individual constraint handling techniques to be used, a new consistency algorithm is also proposed.
APA, Harvard, Vancouver, ISO, and other styles
8

Kutach, Douglas N. "Time Travel and Consistency Constraints." Philosophy of Science 70, no. 5 (December 2003): 1098–113. http://dx.doi.org/10.1086/377392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sam-Haroud, D., and B. Faltings. "Consistency techniques for continuous constraints." Constraints 1, no. 1-2 (September 1996): 85–118. http://dx.doi.org/10.1007/bf00143879.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cooper, Martin, and Thomas Schiex. "Arc consistency for soft constraints." Artificial Intelligence 154, no. 1-2 (April 2004): 199–227. http://dx.doi.org/10.1016/j.artint.2003.09.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Consistency constraints"

1

Nightingale, Peter. "Consistency and the quantified constraint satisfaction problem /." St Andrews, 2007. http://hdl.handle.net/10023/759.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mäs, Stephan. "On the Consistency of Spatial Semantic Integrity Constraints." Neubiberg Universitätsbibliothek der Universität der Bundeswehr, 2010. http://d-nb.info/1000831663/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wieweg, William. "Towards Arc Consistency in PLAS." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232081.

Full text
Abstract:
The Planning And Scheduling (PLAS) module of ICE (Intelligent Control Environment) is responsible for planning and scheduling a large fleet of vehicles. This process involves the creation of tasks to be executed by the vehicles. Using this information, PLAS decides which vehicles should execute which tasks, which are modelled as constraint satisfaction problems. Solving the constraint satisfaction problems is slow. To improve efficiency, a number of different techniques exist. One of these is arc consistency, that entails taking a constraint satisfaction problem and evaluating its variables pairwise by applying the constraints among them. Using arc consistency, we can discern the candidate solutions to constraint satisfaction problems faster than doing a pure search. In addition, arc consistency allows us to detect and act early on inconsistencies in constraint satisfaction problems. The work in this master thesis includes the implementation of a constraint solver for symbolic constraints, containing the arc consistency algorithm AC3. Furthermore, it encompasses the implementation of a constraint satisfaction problem generator, based on the Erdős-Rényi graph model, inspired by the quasigroup completion problem with holes, that allows the evaluation of the constraint solver on large-sized problems. Using the constraint satisfaction problem generator, a set of experiments were performed to evaluate the constraint solver. Furthermore, a set of complementary scenarios using manually created constraint satisfaction problems were performed to augment the experiments. The results show that the performance scales up well.
Schemaläggningsmodulen PLAS som är en del av ICE (Intelligent Control Environment) är ansvarig för planering och schemaläggning av stora mängder fordonsflottor. Denna process involverar skapandet av uppgifter som behöver utföras av fordonen. Utifrån denna information bestämmer PLAS vilka fordon som ska utföra vilka uppgifter, vilket är modellerat som villkorsuppfyllelseproblem. Att lösa villkorsuppfyllelseproblem är långsamt. För att förbättra prestandan, så finns det en mängd olika tekniker. En av dessa är bågkonsekvens, vilket involverar att betrakta ett villkorsuppfyllelseproblem och utvärdera dess variabler parvis genom att tillämpa villkoren mellan dem. Med hjälp av bågkonsekvens kan vi utröna kandidatlösningar för villkorsuppfyllelseproblemen snabbare, jämfört med ren sökning. Vidare, bågkonsenvens möjliggör upptäckande och bearbetning av inkonsekvenser i villkorsuppfyllelseproblem. Arbetet i denna masteruppsats omfattar genomförandet av en villkorslösare för symboliska villkor, innehållandes bågkonsekvensalgoritmen AC3. Vidare, så innefattar det genomförandet av en villkorsuppfyllelseproblemgenerator, baserad på grafmodellen Erdős-Rényi, inspirerad av kvasigruppkompletteringsproblem med hål, villket möjliggör utvärdering av villkorslösaren på stora problem. Med hjälp av villkorsuppfyllelseproblemgeneratorn så utfördes en mängd experiment för att utvärdera villkorslösaren. Vidare så kompletterades experimenten av en mängd scenarion utförda på manuellt skapade villkorsuppfyllelseproblem. Resultaten visar att prestandan skalar upp bra.
APA, Harvard, Vancouver, ISO, and other styles
4

Asplund, Mikael. "Restoring Consistency after Network Partitions." Licentiate thesis, Linköping : Linköpings universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9913.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mück, Alexander. "The standard model in 5D theoretical consistency and experimental constraints /." [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=974408107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mallur, Vikram. "A Model for Managing Data Integrity." Thesis, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/20233.

Full text
Abstract:
Consistent, accurate and timely data are essential to the functioning of a modern organization. Managing the integrity of an organization’s data assets in a systematic manner is a challenging task in the face of continuous update, transformation and processing to support business operations. Classic approaches to constraint-based integrity focus on logical consistency within a database and reject any transaction that violates consistency, but leave unresolved how to fix or manage violations. More ad hoc approaches focus on the accuracy of the data and attempt to clean data assets after the fact, using queries to flag records with potential violations and using manual efforts to repair. Neither approach satisfactorily addresses the problem from an organizational point of view. In this thesis, we provide a conceptual model of constraint-based integrity management (CBIM) that flexibly combines both approaches in a systematic manner to provide improved integrity management. We perform a gap analysis that examines the criteria that are desirable for efficient management of data integrity. Our approach involves creating a Data Integrity Zone and an On Deck Zone in the database for separating the clean data from data that violates integrity constraints. We provide tool support for specifying constraints in a tabular form and generating triggers that flag violations of dependencies. We validate this by performing case studies on two systems used to manage healthcare data: PAL-IS and iMED-Learn. Our case studies show that using views to implement the zones does not cause any significant increase in the running time of a process.
APA, Harvard, Vancouver, ISO, and other styles
7

Mäs, Stephan [Verfasser], Wolfgang [Akademischer Betreuer] Reinhardt, and Max [Akademischer Betreuer] Egenhofer. "On the Consistency of Spatial Semantic Integrity Constraints / Stephan Mäs. Wolfgang Reinhardt. Max Egenhofer. Universität der Bundeswehr München, Fakultät für Bauingenieur- und Vermessungswesen." Neubiberg : Universitätsbibliothek der Universität der Bundeswehr, 2010. http://d-nb.info/1000831663/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chapovalova, Valentina. "Consistency of Constraint Reifications by Reformulation." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-229577.

Full text
Abstract:
Many combinatorial problems can be formulated via constraints, i.e., relations between variables’ values to be satisfied in order for them to count as a solution for the problem. A lot of these combinatorial relations can be applied to an arbitrary number of arguments, these constraints are called global. Most global constraints (at least 82% in the Global Constraint Catalogue [1]) can be reformulated as a conjunction of total functions together with a constraint which can be directly reified. The reifications are useful in modelling several kinds of combinatorial problems, e.g., when there is a known number of satisfied constraints, but the exact set of satisfied constraints is a priori unknown. In this thesis, we apply different methods in order to determine the consistency level (domain or bounds consistency) of the known reifications, in order to estimate whether the reifications would prune effectively  if they were implemented.
APA, Harvard, Vancouver, ISO, and other styles
9

Francisco, Rodriguez Maria Andreina. "Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-156441.

Full text
Abstract:
In this work we discuss the consistency of constraints for which the set of solutions can be recognised by a deterministic finite automaton. Such an automaton induces a decomposition of the constraint into a conjunction of constraints. Since the level of filtering for the conjunction of constraints is not known, at any point during search there might be only one possible solution but, since all impossible values might not have yet been removed, we could be wasting time looking at impossible combinations of values. The so far most general result is that if the constraint hypergraph of such a decomposition is Berge-acyclic, then the decomposition provides hyper-arc consistency, which means that the decomposition achieves the best possible filtering. We focus our work on constraint networks that have alpha-acyclic, centred-cyclic or sliding-cyclic hypergraph representations. For each of these kinds of constraints networks we show systematically the necessary conditions to achieve hyper-arc consistency.
APA, Harvard, Vancouver, ISO, and other styles
10

Nightingale, Peter William. "Consistency and the Quantified Constraint Satisfaction Problem." Thesis, University of St Andrews, 2007. http://hdl.handle.net/10023/759.

Full text
Abstract:
Constraint satisfaction is a very well studied and fundamental artificial intelligence technique. Various forms of knowledge can be represented with constraints, and reasoning techniques from disparate fields can be encapsulated within constraint reasoning algorithms. However, problems involving uncertainty, or which have an adversarial nature (for example, games), are difficult to express and solve in the classical constraint satisfaction problem. This thesis is concerned with an extension to the classical problem: the Quantified Constraint Satisfaction Problem (QCSP). QCSP has recently attracted interest. In QCSP, quantifiers are allowed, facilitating the expression of uncertainty. I examine whether QCSP is a useful formalism. This divides into two questions: whether QCSP can be solved efficiently; and whether realistic problems can be represented in QCSP. In attempting to answer these questions, the main contributions of this thesis are the following: - the definition of two new notions of consistency; - four new constraint propagation algorithms (with eight variants in total), along with empirical evaluations; - two novel schemes to implement the pure value rule, which is able to simplify QCSP instances; - a new optimization algorithm for QCSP; - the integration of these algorithms and techniques into a solver named Queso; - and the modelling of the Connect 4 game, and of faulty job shop scheduling, in QCSP. These are set in context by a thorough review of the QCSP literature.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Consistency constraints"

1

Stergiou, K. Backtracking algorithms for checking the consistency of temporal constraints. Manchester: UMIST, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lowe, David G. The viewpoint consistency constraint. New York: Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mann, Peter. Liouville’s Theorem & Classical Statistical Mechanics. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198822370.003.0020.

Full text
Abstract:
This chapter returns to the discussion of constrained Hamiltonian dynamics, now in the canonical setting, including topics such as regular Lagrangians, constraint surfaces, Hessian conditions and the constrained action principle. The standard approach to Hamiltonian mechanics is to treat all the variables as being independent; in the constrained case, a constraint function links the variables so they are no longer independent. In this chapter, the Dirac–Bergmann theory for singular Lagrangians is developed, using an action-based approach. The chapter then investigates consistency conditions and Dirac’s different types of constraints (i.e. first-class constraints, second-class constraints, primary constraints and secondary constraints) before deriving the Dirac bracket from simple arguments. The Jackiw–Fadeev constraint formulation is then discussed before the chapter closes with the Güler formulation for a constrained Hamilton–Jacobi theory.
APA, Harvard, Vancouver, ISO, and other styles
4

Variego, Jorge. Composing with Constraints. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780190057237.001.0001.

Full text
Abstract:
Designed for undergraduate and graduate music students, Composing with Constraints provides 100 self-contained exercises to help develop the craft of music composition through rigorous guidelines that help students develop their creativity. Structured in five chapters, the book offers an extended palette of compositional exercises in melody, rhythm, harmony, texture, and pre-compositional strategies. Exercises can be addressed in any order. With the help of the instructor, both graduate and undergraduate students can choose their own paths. An appendix includes a select list of possible solutions for the exercises and a suggested grading rubric is included for the instructor, based on consistent criteria that balance the strictness of the constraints with the incentive of the students’ imagination. All exercises embed simple orchestration problems and are illustrated with excerpts from the standard repertoire. Exercises that encourage the implementation of the computer as an aid to enhance the creative process are included.
APA, Harvard, Vancouver, ISO, and other styles
5

Terrones, Marco, Ceyhun Bora Durdu, and Enrique G. Mendoza. On the Solvency of Nations: Are Global Imbalances Consistent with Intertemporal Budget Constraints? International Monetary Fund, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Terrones, Marco, Ceyhun Bora Durdu, and Enrique G. Mendoza. On the Solvency of Nations: Are Global Imbalances Consistent with Intertemporal Budget Constraints? International Monetary Fund, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Terrones, Marco, Ceyhun Bora Durdu, and Enrique G. Mendoza. On the Solvency of Nations: Are Global Imbalances Consistent with Intertemporal Budget Constraints? International Monetary Fund, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shiffrar, Maggie, and Christina Joseph. Paths of Apparent Human Motion Follow Motor Constraints. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199794607.003.0077.

Full text
Abstract:
The phenomenon of apparent motion, or the illusory perception of movement from rapidly displayed static images, provides an excellent platform for the study of how perceptual systems analyze input over time and space. Studies of the human body in apparent motion further suggest that the visual system is also influenced by an observer’s motor experience with his or her own body. As a result, the human visual system sometimes processes human movement differently from object movement. For example, under apparent motion conditions in which inanimate objects appear to traverse the shortest possible paths of motion, human motion instead appears to follow longer, biomechanically plausible paths of motion. Psychophysical and brain imaging studies converge in supporting the hypothesis that the visual analysis of human movement differs from the visual analysis of nonhuman movements whenever visual motion cues are consistent with an observer’s motor repertoire of possible human actions.
APA, Harvard, Vancouver, ISO, and other styles
9

Botman, Dennis P., Maurice Obstfeld, Vitor Gaspar, Douglas Laxton, and Ratna Sahay. Macroeconomic Management When Policy Space Is Constrained: A Comprehensive, Consistent and Coordinated Approach to Economic Policy. International Monetary Fund, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Frascarelli, Mara. The interpretation of pro in consistent and partial null-subject languages. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198815853.003.0009.

Full text
Abstract:
This chapter deals with the acceptability and interpretation of referential null subjects (NSs) and compares consistent pro-drop in Italian with equivalent sentences in Finnish (a partial NS language), in different syntactic constructions (matrix, completive, factive, and adverbial clauses). This leads to the formulation of an original proposal that opens new perspectives for future research. Specifically, based on the interpretive judgements of 273 native speakers of Finnish, it is shown that a Topic chain analysis (Frascarelli 2007) can (and should) be assumed in partial NS languages as well, and that ‘partiality’ cannot be explained through narrow syntactic constraints. The Locality requirement is thus re-proposed as an Interface Visibility Condition (IVC), according to which in partial NS languages a pro is preferably interpreted as referring to the closest overt link in a Topic chain. The Topic Criterion is thus proposed as a Macroparameter of NS languages and the necessity of a ‘graded analysis’ ascribed to the IVC (as a Mesoparameter).
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Consistency constraints"

1

Li, Bing, and Utpal Roy. "Motion constraints in a 2D polygonal assembly." In Global Consistency of Tolerances, 325–34. Dordrecht: Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-017-1705-2_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Legtchenko, Andreï, and Arnaud Lallouet. "Consistency for Partially Defined Constraints." In Principles and Practice of Constraint Programming - CP 2005, 854. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564751_92.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schiex, Thomas. "Arc Consistency for Soft Constraints." In Principles and Practice of Constraint Programming – CP 2000, 411–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45349-0_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sellmann, Meinolf. "Approximated Consistency for Knapsack Constraints." In Principles and Practice of Constraint Programming – CP 2003, 679–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45193-8_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Haroud, D., and B. Faltings. "Global consistency for continuous constraints." In Lecture Notes in Computer Science, 40–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58601-6_88.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Groher, Iris, Alexander Reder, and Alexander Egyed. "Incremental Consistency Checking of Dynamic Constraints." In Fundamental Approaches to Software Engineering, 203–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12029-9_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cui, Yi, Xianchao Zhang, Linlin Zong, and Jie Mu. "Maintaining Consistency with Constraints: A Constrained Deep Clustering Method." In Advances in Knowledge Discovery and Data Mining, 219–30. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75765-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Silaghi, Marius-Călin, Djamila Sam-Haroud, and Boi Faltings. "Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation." In New Trends in Constraints, 173–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44654-0_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bottoni, Paolo, Manuel Koch, Francesco Parisi-Presicce, and Gabriele Taentzer. "Consistency Checking and Visualization of OCL Constraints." In ≪UML≫ 2000 — The Unified Modeling Language, 294–308. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40011-7_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hartmann, Sven. "On the Consistency of Int-cardinality Constraints." In Conceptual Modeling – ER ’98, 150–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-540-49524-6_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Consistency constraints"

1

Lallouet, A., and A. Legtchenko. "Consistency for partially defined constraints." In 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05). IEEE, 2005. http://dx.doi.org/10.1109/ictai.2005.49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tian Bai, Guohui Li, and Yunsheng Liu. "Scheduling queries with relative consistency constraints." In 2011 International Conference on Computer Science and Service System (CSSS). IEEE, 2011. http://dx.doi.org/10.1109/csss.2011.5974545.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Manandhar, Suresh. "Deterministic consistency checking of LP constraints." In the seventh conference. Morristown, NJ, USA: Association for Computational Linguistics, 1995. http://dx.doi.org/10.3115/976973.976997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aki, Selim G., and Dorothy E. Denning. "Checking Classification Constraints for Consistency and Completeness." In 1987 IEEE Symposium on Security and Privacy. IEEE, 1987. http://dx.doi.org/10.1109/sp.1987.10000.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chojnacki, Wojciech, Zygmunt L. Szpak, Michael J. Brooks, and Anton van den Hengel. "Multiple Homography Estimation with Full Consistency Constraints." In 2010 International Conference on Digital Image Computing: Techniques and Applications (DICTA). IEEE, 2010. http://dx.doi.org/10.1109/dicta.2010.87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yip, Justin, and Pascal Van Hentenryck. "Length-lex bound consistency for knapsack constraints." In the 2009 ACM symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1529282.1529594.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abián, David, Jorge Bernad, and Raquel Trillo-Lado. "Using contemporary constraints to ensure data consistency." In SAC '19: The 34th ACM/SIGAPP Symposium on Applied Computing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3297280.3297509.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guo, Tao, and Raymond W. Yeung. "Extended Multiple Descriptions with Reconstruction Consistency Constraints." In 2016 IEEE Globecom Workshops (GC Wkshps). IEEE, 2016. http://dx.doi.org/10.1109/glocomw.2016.7848904.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vieira, Ana Sofia. "Consistency Management in Feature-Based Parametric Design." In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0237.

Full text
Abstract:
Abstract One of the main problems to be solved in design-by-features is to preserve the semantic correctness of feature-based models. Currently, feature-based parametric design (FbPD) is being used as one of the most powerful approaches for solving this problem. In this paper, a fundamental principle of this approach is introduced. Three aspects stated, are: FbPD deals with functional design primitives, it solves the automatic generation of model variations, and it offers the basis for the development of a mechanism to check the semantic correctness of feature-based models. Several concepts for the definition of semantic constraints are presented. They instigate the classification of semantic constraints in four different categories, based on the constraint evaluation-time, purpose, behaviour, and representation. Sinfonia, a system for feature-based parametric design, is presented as a testbed environment for design-by-features applications. One of its modules, the Consistency Handler, uses the constraint concepts introduced in order to preserve the semantic consistency of the models. Several examples illustrate the different types of constraints. In addition, an algorithm applied for the process of a consistent feature modification is presented.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Lujuan, Jun Li, Tao Huang, Zhenyuan Ma, Zhiyong Lin, and Mukesh Prasad. "GAN2C: Information Completion GAN with Dual Consistency Constraints." In 2018 International Joint Conference on Neural Networks (IJCNN). IEEE, 2018. http://dx.doi.org/10.1109/ijcnn.2018.8489550.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Consistency constraints"

1

Krommes, J. A., and Chang-Bae Kim. Magnetic fluctuations can contribute to plasma transport, ''self-consistency constraints'' notwithstanding. Office of Scientific and Technical Information (OSTI), September 1987. http://dx.doi.org/10.2172/5867927.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Peñaloza, Rafael. Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm. Technische Universität Dresden, 2011. http://dx.doi.org/10.25368/2022.181.

Full text
Abstract:
Very recently, the tableau-based algorithm for deciding consistency of general fuzzy DL ontologies over the product t-norm was shown to be incorrect, due to a very weak blocking condition. In this report we take the first steps towards a correct algorithm by modifying the blocking condition, such that the (finite) structure obtained through the algorithm uniquely describes an infinite system of quadratic constraints. We show that this procedure terminates, and is sound and complete in the sense that the input is consistent iff the corresponding infinite system of constraints is satisfiable.
APA, Harvard, Vancouver, ISO, and other styles
3

Miller, Kathryn. NIST Conference Papers Fiscal Year 2019 NIST Conference Papers Fiscal Year 2019. Gaithersburg, MD: National Institute of Standards and Technology, 2022. http://dx.doi.org/10.6028/nist.sp.1276v1.

Full text
Abstract:
NIST is committed to the idea that results of federally funded research are a valuable national resource and a strategic asset. To the extent feasible and consistent with law, agency mission, resource constraints, and U.S. national, homeland, and economic security, NIST will promote the deposit of scientific data arising from unclassified research and programs, funded wholly or in part by NIST, except for Standard Reference Data, free of charge in publicly accessible databases. Subject to the same conditions and constraints listed above, NIST also intends to make freely available to the public, in publicly accessible repositories, all peer-reviewed scholarly publications arising from unclassified research and programs funded wholly or in part by NIST. This Special Publication represents the work of researchers at professional conferences, as reported in Fiscal Year 2019. More information on public access to NIST research is available at https://www.nist.gov/ open.
APA, Harvard, Vancouver, ISO, and other styles
4

Miller, Kathryn. NIST Conference Papers Fiscal Year 2019 NIST Conference Papers Fiscal Year 2019. Gaithersburg, MD: National Institute of Standards and Technology, 2022. http://dx.doi.org/10.6028/nist.sp.1276v2.

Full text
Abstract:
NIST is committed to the idea that results of federally funded research are a valuable national resource and a strategic asset. To the extent feasible and consistent with law, agency mission, resource constraints, and U.S. national, homeland, and economic security, NIST will promote the deposit of scientific data arising from unclassified research and programs, funded wholly or in part by NIST, except for Standard Reference Data, free of charge in publicly accessible databases. Subject to the same conditions and constraints listed above, NIST also intends to make freely available to the public, in publicly accessible repositories, all peer-reviewed scholarly publications arising from unclassified research and programs funded wholly or in part by NIST. This Special Publication represents the work of researchers at professional conferences, as reported in Fiscal Year 2019. More information on public access to NIST research is available at https://www.nist.gov/ open.
APA, Harvard, Vancouver, ISO, and other styles
5

Miller, Kathryn. NIST Conference Papers Fiscal Year 2019 NIST Conference Papers Fiscal Year 2019. Gaithersburg, MD: National Institute of Standards and Technology, 2022. http://dx.doi.org/10.6028/nist.sp.1276v3.

Full text
Abstract:
NIST is committed to the idea that results of federally funded research are a valuable national resource and a strategic asset. To the extent feasible and consistent with law, agency mission, resource constraints, and U.S. national, homeland, and economic security, NIST will promote the deposit of scientific data arising from unclassified research and programs, funded wholly or in part by NIST, except for Standard Reference Data, free of charge in publicly accessible databases. Subject to the same conditions and constraints listed above, NIST also intends to make freely available to the public, in publicly accessible repositories, all peer-reviewed scholarly publications arising from unclassified research and programs funded wholly or in part by NIST. This Special Publication represents the work of researchers at professional conferences, as reported in Fiscal Year 2019. More information on public access to NIST research is available at https://www.nist.gov/ open.
APA, Harvard, Vancouver, ISO, and other styles
6

Neyedley, K., J. J. Hanley, Z. Zajacz, and M. Fayek. Accessory mineral thermobarometry, trace element chemistry, and stable O isotope systematics, Mooshla Intrusive Complex (MIC), Doyon-Bousquet-LaRonde mining camp, Abitibi greenstone belt, Québec. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328986.

Full text
Abstract:
The Mooshla Intrusive Complex (MIC) is an Archean polyphase magmatic body located in the Doyon-Bousquet-LaRonde (DBL) mining camp of the Abitibi greenstone belt, Québec, that is spatially associated with numerous gold (Au)-rich VMS, epizonal 'intrusion-related' Au-Cu vein systems, and shear zone-hosted (orogenic?) Au deposits. To elucidate the P-T conditions of crystallization, and oxidation state of the MIC magmas, accessory minerals (zircon, rutile, titanite) have been characterized using a variety of analytical techniques (e.g., trace element thermobarometry). The resulting trace element and oxythermobarometric database for accessory minerals in the MIC represents the first examination of such parameters in an Archean magmatic complex in a world-class mineralized district. Mineral thermobarometry yields P-T constraints on accessory mineral crystallization consistent with the expected conditions of tonalite-trondhjemite-granite (TTG) magma genesis, well above peak metamorphic conditions in the DBL camp. Together with textural observations, and mineral trace element data, the P-T estimates reassert that the studied minerals are of magmatic origin and not a product of metamorphism. Oxygen fugacity constraints indicate that while the magmas are relatively oxidizing (as indicated by the presence of magmatic epidote, titanite, and anhydrite), zircon trace element systematics indicate that the magmas were not as oxidized as arc magmas in younger (post-Archean) porphyry environments. The data presented provides first constraints on the depth and other conditions of melt generation and crystallization of the MIC. The P-T estimates and qualitative fO2 constraints have significant implications for the overall model for formation (crystallization, emplacement) of the MIC and potentially related mineral deposits.
APA, Harvard, Vancouver, ISO, and other styles
7

Nguyen, Kim. Do Australian Households Borrow to Keep up with the Joneses? Reserve Bank of Australia, November 2022. http://dx.doi.org/10.47688/rdp2022-06.

Full text
Abstract:
I examine whether and how local income inequality affects household debt and its composition using household panel data for Australia from the Household, Income and Labour Dynamics in Australia Survey. I find that middle-income households without liquidity and credit constraints tend to borrow more for non-residential investment purposes as local income inequality rises, suggesting that they are trying to close the income gap. They also appear to try to close the consumption gap by accumulating more car debt with a rise in local income inequality. Both findings are consistent with households 'keeping up with the Joneses', but unlikely to have implications for macrofinancial stability given that households taking on debt appear well resourced.
APA, Harvard, Vancouver, ISO, and other styles
8

Hoffmann, Bridget, and Juan Pablo Rud. Open configuration options Exposure or Income? The Unequal Effects of Pollution on Daily Labor Supply. Inter-American Development Bank, February 2022. http://dx.doi.org/10.18235/0004003.

Full text
Abstract:
We use high-frequency data on fine particulate matter air pollution (PM 2.5) at the locality level to study the effects of high pollution on labor supply decisions and hospitalizations for respiratory disease in the metropolitan area of Mexico City. We document a negative, non-linear relationship between PM 2.5 and same-day labor supply, with strong effects on days with extremely high pollution levels. On these days, the average worker experiences a reduction of around 7.5% of working hours. Workers partially compensate for lost hours by increasing their labor supply on days that follow high-pollution days. Informal workers reduce their labor supply less than formal workers on high-pollution days and also compensate less on the following days. This suggests that informal workers may experience greater exposure to high pollution and greater reductions in labor supply and income. We provide evidence that reductions in labor supply due to high pollution are consistent with avoidance behavior and that income constraints may play an important role in workers' labor supply decisions.
APA, Harvard, Vancouver, ISO, and other styles
9

Blyde, Juan S., Christian Volpe Martincus, Marcelo Dolabella, and Ignacio Marra de Artiñano. The Reorganization of Global Value Chains: What’s in it for Latin America and the Caribbean? Inter-American Development Bank, December 2022. http://dx.doi.org/10.18235/0004592.

Full text
Abstract:
As Latin America and the Caribbean bounce back from a sanitary crisis of historic proportions, the search is on for policies that can accelerate recovery while boosting long-term growth. In a scenario of tight fiscal constraints, trade and integration (T&I) policies seem to fit this description. There are particularly high expectations in some policy circles that the benefits of T&I policies will be boosted by an impending reorganization of global value chains. Yet little is known about the relevance, shape, and impacts of this reorganization. Will this lead to reshoring, nearshoring, or some slightly modified version of the status quo? Will this benefit the region? This paper takes a stab at answering these questions. It begins with a critical review of the most frequently cited drivers of the reorganization. This is then followed by an analytical exercise that uses the 20182019 US import tariff hike as a quasi-natural experiment. The results seem more consistent with modest trade and investment gains for the region, associated with incremental rather than major adjustments to global value chains. It concludes by arguing that whatever the future brings, minimizing trade and investment costs is likely to remain the regions dominant strategy.
APA, Harvard, Vancouver, ISO, and other styles
10

Nolan, Brian, Brenda Gannon, Richard Layte, Dorothy Watson, Christopher T. Whelan, and James Williams. Monitoring Poverty Trends in Ireland: Results from the 2000 Living in Ireland survey. ESRI, July 2002. http://dx.doi.org/10.26504/prs45.

Full text
Abstract:
This study is the latest in a series monitoring the evolution of poverty, based on data gathered by The ESRI in the Living in Ireland Surveys since 1994. These have allowed progress towards achieving the targets set out in the National Anti Poverty Strategy since 1997 to be assessed. The present study provides an updated picture using results from the 2000 round of the Living in Ireland survey. The numbers interviewed in the 2000 Living in Ireland survey were enhanced substantially, to compensate for attrition in the panel survey since it commenced in 1994. Individual interviews were conducted with 8,056 respondents. Relative income poverty lines do not on their own provide a satisfactory measure of exclusion due to lack of resources, but do nonetheless produce important key indicators of medium to long-term background trends. The numbers falling below relative income poverty lines were most often higher in 2000 than in 1997 or 1994. The income gap for those falling below these thresholds also increased. By contrast, the percentage of persons falling below income lines indexed only to prices (rather than average income) since 1994 or 1997 fell sharply, reflecting the pronounced real income growth throughout the distribution between then and 2000. This contrast points to the fundamental factors at work over this highly unusual period: unemployment fell very sharply and substantial real income growth was seen throughout the distribution, including social welfare payments, but these lagged behind income from work and property so social welfare recipients were more likely to fall below thresholds linked to average income. The study shows an increasing probability of falling below key relative income thresholds for single person households, those affected by illness or disability, and for those who are aged 65 or over - many of whom rely on social welfare support. Those in households where the reference person is unemployed still face a relatively high risk of falling below the income thresholds but continue to decline as a proportion of all those below the lines. Women face a higher risk of falling below those lines than men, but this gap was marked among the elderly. The study shows a marked decline in deprivation levels across different household types. As a result consistent poverty, that is the numbers both below relative income poverty lines and experiencing basic deprivation, also declined sharply. Those living in households comprising one adult with children continue to face a particularly high risk of consistent poverty, followed by those in families with two adults and four or more children. The percentage of adults in households below 70 per cent of median income and experiencing basic deprivation was seen to have fallen from 9 per cent in 1997 to about 4 per cent, while the percentage of children in such households fell from 15 per cent to 8 per cent. Women aged 65 or over faced a significantly higher risk of consistent poverty than men of that age. Up to 2000, the set of eight basic deprivation items included in the measure of consistent poverty were unchanged, so it was important to assess whether they were still capturing what would be widely seen as generalised deprivation. Factor analysis suggested that the structuring of deprivation items into the different dimensions has remained remarkably stable over time. Combining low income with the original set of basic deprivation indicators did still appear to identify a set of households experiencing generalised deprivation as a result of prolonged constraints in terms of command over resources, and distinguished from those experiencing other types of deprivation. However, on its own this does not tell the whole story - like purely relative income measures - nor does it necessarily remain the most appropriate set of indicators looking forward. Finally, it is argued that it would now be appropriate to expand the range of monitoring tools to include alternative poverty measures incorporating income and deprivation. Levels of deprivation for some of the items included in the original basic set were so low by 2000 that further progress will be difficult to capture empirically. This represents a remarkable achievement in a short space of time, but poverty is invariably reconstituted in terms of new and emerging social needs in a context of higher societal living standards and expectations. An alternative set of basic deprivation indicators and measure of consistent poverty is presented, which would be more likely to capture key trends over the next number of years. This has implications for the approach adopted in monitoring the National Anti-Poverty Strategy. Monitoring over the period to 2007 should take a broader focus than the consistent poverty measure as constructed to date, with attention also paid to both relative income and to consistent poverty with the amended set of indicators identified here.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Consistency constraints' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography