Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
Designing a secure and dependable system is not just a technical issue, it involves also a deep analysis of the organizational and the social environment in which the system will ...
Yudistira Asnar, Paolo Giorgini, Roberto Bonato, V...
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
In this case study I argue for the usage of a machine-oriented controlled natural language as interface language to knowledge systems. Instead of using formal languages that are di...
Propositionalization has already been shown to be a particularly promising approach for robustly and effectively handling relational data sets for knowledge discovery. In this pap...