Henri Farreny

Learn More
We propose a formal generalization for various works dealing with Heuristic Search in State Graphs. This generalization focuses on the properties of the evaluation functions, on the characteristics of the state graphs, on the notion of path length, on the procedures that control the node expansions, on the rules that govern the update operations.(More)
A new approach, which is based on possibility theory, for dealing with uncertain facts and default rules is proposed. The chaining of certain or uncertain facts and rules is discussed in detail. The modus ponens, themodus tollens, and the resolution principle in the propositional case are generalized and patterns of plausible reasoning are recovered. Only(More)