We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...