Shao and Wang have proposed a cognitive complexity measure[8] as a metric that can be used for estimating the comprehension effort for understanding software written in imperative...
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
Stochastically searching the space of candidate clauses is an appealing way to scale up ILP to large datasets. We address an approach that uses a Bayesian network model to adaptive...
With this talk we want to pay tribute to the late Professor Gerd Veenker who deserves the historic credit of initiating the formation of the German AI community. We present a summa...
We present a dynamic epistemic logic for knowledge change of rational agents. Existing approaches only deal with partial public announcements, that means an announcement may lead ...