Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at e...
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
We present a model of access control which provides fine-grained data-dependent control, can express permissions about permissions, can express delegation, and can describe syste...
Dimitar P. Guelev, Mark Ryan, Pierre-Yves Schobben...
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...