One of the few algorithms that can evaluate features in very large feature sets is Relief [1, 2]. This paper documents a bias in Relief against non-monotonic features, including Gaussian features, and proposes a modification to Relief that removes the bias.

We introduce a model of menu choice in which a person’s psychological tastes and revealed preferences may be distinct. The former is modeled by means of a possibly incomplete (but otherwise rational) preference relation <, and the latter by a completion <∗ of that relation. The two relations are connected through an axiom which formalizes the following intuitive rule: “Whenever in doubt about w...

We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increasing) limitwise monotonic on various

The simulation of vehicular traffic as well as pedestrian dynamics meanwhile both have a decades long history. The success of this conference series, PED and others show that the interest in these topics is still strongly increasing. This contribution deals with a combination of both systems: pedestrians crossing a street. In a VISSIM simulation for varying demand jam sizes of vehicles as well ...

We extend universal moral grammar theory (UMGT) with nonmonotonic logic. Our experiment shows that such revision is necessary as it allows to account for the effects of alleviations and aggravations in moral reasoning. Our new theory updates UMGT from classical to non-monotonic logic, which reflects the incompleteness of information and uncertainty in actual human reasoning. In addition, it pro...

We introduce 3-valued extensions of major non-monotonic formalisms and we prove that the recently proposed well-founded semantics of logic programs is equivalent, for arbitrary logic programs, to 3-valued forms of McCarthy's circumscription, Reiter's closed world assumption, Moore's autoepistemic logic and Reiter's default theory. This result not only provides a further justiication of the well...

The notion of assumption-based framework generalises and reenes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-monotonic consequence of a theory if it can be derived monotonically from a theory extended by means of acceptable assumptions. The notion of acceptability for such assumptions is formulated in terms of their ability succ...

1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this paper, we extend the language of Hybrid Probabilistic Logic Programs framework in [20] to allow non-monotonic negation, and define two alternative semantics: stable probabilistic model semantics and probabilistic wel...