We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Being part of domain engineering, domain analysis enables identifying domains and capturing their ontologies in order to assist and guide system developers to design domain-specifi...
Referential integrity underlies the relational representation of objeceoriented structures. The concept of referential integrity in relational databases is hindered by the confusi...