Now showing items 1-2 of 2

  • Answer set programming for computing decisions under uncertainty 

    Confalonieri, Roberto; Prade, Henri (Springer, 2011)
    Conference report
    Restricted access - publisher's policy
    Possibility theory offers a qualitative framework for modeling decision under uncertainty. In this setting, pessimistic and optimistic decision criteria have been formally justified. The computation by means of possibilistic ...
  • Handling exceptions in logic programming without negation as failure 

    Confalonieri, Roberto; Prade, Henri; Nieves Sánchez, Juan Carlos (Springer, 2011)
    Conference report
    Restricted access - publisher's policy
    Default rules, i.e. statements of the form normally a’s are b’s, are usually handled in Answer Set Programming by means of negation as failure which provides a way to capture exceptions to normal situations. In this paper ...