{"id":82765,"date":"2026-10-28T15:08:39","date_gmt":"2026-10-28T14:08:39","guid":{"rendered":"https:\/\/nilu.gnist.dev\/publikasjoner\/query-driven-qualitative-constraint-acquisition\/"},"modified":"2026-10-28T15:08:39","modified_gmt":"2026-10-28T14:08:39","slug":"query-driven-qualitative-constraint-acquisition","status":"publish","type":"nva_publication","link":"https:\/\/nilu.gnist.dev\/en\/publications\/query-driven-qualitative-constraint-acquisition\/","title":{"rendered":"Query-driven Qualitative Constraint Acquisition"},"content":{"rendered":"<p class=\"wp-block-paragraph\">Many planning, scheduling or multi-dimensional packing problems involve the design of subtle logical combinations of temporal or spatial constraints. Recently, we introduced GEQCA-I, which stands for Generic Qualitative Constraint Acquisition, as a new active constraint acquisition method for learning qualitative constraints using qualitative queries. In this paper, we revise and extend GEQCA-I to GEQCA-II with a new type of query, universal query, for qualitative constraint acquisition, with a deeper query-driven acquisition algorithm. Our extended experimental evaluation shows the efficiency and usefulness of the concept of universal query in learning randomly-generated qualitative networks, including both temporal networks based on Allen\u2019s algebra and spatial networks based on region connection calculus. We also show the effectiveness of GEQCA-II in learning the qualitative part of real scheduling problems.<\/p>\n","protected":false},"template":"","meta":{"_acf_changed":false,"_searchwp_excluded":"","_id":"","_status":"PUBLISHED","_sync_date":"2026-10-27 21:32:11","footnotes":""},"nva_tax_category":[927],"class_list":["post-82765","nva_publication","type-nva_publication","status-publish","hentry","nva_tax_category-scientific-journal-publication"],"acf":[],"_links":{"self":[{"href":"https:\/\/nilu.gnist.dev\/en\/wp-json\/wp\/v2\/nva_publication\/82765","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nilu.gnist.dev\/en\/wp-json\/wp\/v2\/nva_publication"}],"about":[{"href":"https:\/\/nilu.gnist.dev\/en\/wp-json\/wp\/v2\/types\/nva_publication"}],"version-history":[{"count":0,"href":"https:\/\/nilu.gnist.dev\/en\/wp-json\/wp\/v2\/nva_publication\/82765\/revisions"}],"wp:attachment":[{"href":"https:\/\/nilu.gnist.dev\/en\/wp-json\/wp\/v2\/media?parent=82765"}],"wp:term":[{"taxonomy":"nva_tax_category","embeddable":true,"href":"https:\/\/nilu.gnist.dev\/en\/wp-json\/wp\/v2\/nva_tax_category?post=82765"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}