Nomenclature codesNomenclature codes or codes of nomenclature are the various rulebooks that govern biological taxonomic nomenclature, each in their own broad field of organisms. To an end-user who only deals with names of species, with some awareness that species are assignable to families, it may not be noticeable that there is more than one code, but beyond this basic level these are rather different in the way they work. The successful introduction of two-part names for species by Linnaeus was the start for an ever-expanding system of nomenclature.
NomenclatureUne nomenclature est un système de classification (code, tableau, liste, règles d'attribution d'identité...) servant de référence dans le cadre d'une activité professionnelle, industrielle ou d'une discipline donnée (exemples : en chimie, en botanique, en zoologie, en astronomie). La nomenclature est un élément-clé de toute taxonomie. Le mot et l'idée viennent directement du latin nomenclatura. Primitivement, le nomenclator désigne l'esclave qui clame les noms des plats d'un dîner ou annonce les personnes à leur arrivée en un lieu.
Programmation par contraintesLa programmation par contraintes (PPC, ou CP pour constraint programming en anglais) est un paradigme de programmation apparu dans les années 1970 et 1980 permettant de résoudre des problèmes combinatoires de grande taille tels que les problèmes de planification et d'ordonnancement. En programmation par contraintes, on sépare la partie modélisation à l'aide de problèmes de satisfaction de contraintes (ou CSP pour Constraint Satisfaction Problem), de la partie résolution dont la particularité réside dans l'utilisation active des contraintes du problème pour réduire la taille de l'espace des solutions à parcourir (on parle de propagation de contraintes).
Constraint logic programmingConstraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is . In this clause, is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.
Solid modelingSolid modeling (or solid modelling) is a consistent set of principles for mathematical and computer modeling of three-dimensional shapes (solids). Solid modeling is distinguished within the broader related areas of geometric modeling and computer graphics, such as 3D modeling, by its emphasis on physical fidelity. Together, the principles of geometric and solid modeling form the foundation of 3D-computer-aided design and in general support the creation, exchange, visualization, animation, interrogation, and annotation of digital models of physical objects.
