Le 21 avril 1949 à l’aube, une femme de 32 ans, est guillotinée dans la cour de la prison d’Angers. Condamnée à mort pour homicide conjugal, Germaine Leloy est la dernière femme à être exécutée en France. Tout l’intérêt du nouveau livre de l’historienne Catherine Valenti est de mettre en avant le parcours de cette femme en déroulant sous la forme d’un récit une affaire criminelle. En effet, son nom s’est effacé de la mémoire collective. Germaine Leloy n’appartient pas aux (...) figures des personna... (shrink)

In this paper we propoee a logic programming language which supports hypothetical updates together with integrity constraints. The language makes use of a revision mechanism, which is needed to restore consistency when an update violates some integrity constraint. The revision policy adopted is based on the simple idea that more recent information is preferred to earlier one. We show how this language can be used to represent and perform several types of defeasible reasoning. We develop a logical characterization of the (...) language in a three-valued conditional logic, by introducing a completion construction. We show that the operational semantics is sound and complete with respect to the completion construction. (shrink)

In this paper we propose a conditional logic called IBC to represent iterated belief revision systems. We propose a set of postulates for iterated revision which are a small variant of Darwiche and Pearl''s ones. The conditional logic IBC has a standard semantics in terms of selection function models and provides a natural representation of epistemic states. We establish a correspondence between iterated belief revision systems and IBC-models. Our representation theorem does not entail Gärdenfors'' Triviality Result.

In this paper we present a theory for reasoning about actions which is based on Dynamic Linear Time Temporal Logic . DLTL is a simple extension of propositional temporal logic of linear time in which regular programs of propositional dynamic logic can be used for indexing temporal modalities. The action theory we define allows to reason with incomplete initial states, to do postdiction and to deal with ramifications and with nondeterministic actions, which are captured by possibly alternative extensions . The (...) expressiveness of temporal logic is exploited to enhance the action language by allowing the definition of general temporal constraints as well as complex actions in the specification of the domain description. We show that the temporal projection problem and the planning problem can be modelled as satisfiability problems in DLTL. (shrink)