We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Abstract: Models are important artefacts that support human understanding and communication. Often software development involves specialists from a variety of fields, e.g. mathemat...
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...