Papers by Philippe Besnard
... 2.5 Logical Languages for Knowledge Representation Since we have been justifying the use of f... more ... 2.5 Logical Languages for Knowledge Representation Since we have been justifying the use of formal logics to represent knowledge, we should pay some attention to the problem of choosing the logical language which is best suited for such a task. ...
... 2.5 Logical Languages for Knowledge Representation Since we have been justifying the use of f... more ... 2.5 Logical Languages for Knowledge Representation Since we have been justifying the use of formal logics to represent knowledge, we should pay some attention to the problem of choosing the logical language which is best suited for such a task. ...
Annales Des Telecommunications, 1989
Argumentation systems permit to nd arguments in favour and against hypotheses. And these hypothes... more Argumentation systems permit to nd arguments in favour and against hypotheses. And these hypotheses can be accepted as true or must be refuted as false according to whether the arguments supporting or refuting them are considered to be valid. Possibly the likelihood of arguments can be measured by probabilities. Then argumentation systems permit to de ne numerical degrees of support of hypotheses as the probability that arguments supporting the hypotheses are true. Similarly, n umerical degrees of plausibility o f h ypotheses can be de ned as the probability that arguments refuting the hypotheses do not hold. These probabilistic argumentation systems lead then to a Dempster-Shafer theory of evidence. In this paper rst an algebraic theory of argumentation systems is developped based on general logical consequence relations and the notion of an allocation of support. In particular a computational theory for argumentation systems using local computations on hypertrees is studied on the fundaments of Shafer's paper \An axiomatic study of computations in hypertrees". This is then extended to probabilistic argumentation systems and evidence theory. The theory is last illustrated by an example, namely assumption-based reasoning.
Innovation Et Technologie En Biologie Et Medecine, 1987
Theoria an International Journal For Theory History and Foundations of Science, 1995
This is the Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, whi... more This is the Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, which was held in Montreal, QU, August 18-20, 1995
Lecture Notes in Computer Science, 1988
We present a first-order logical system based on a standard first-order language which is enriche... more We present a first-order logical system based on a standard first-order language which is enriched with new predicate symbols — supposition predicates. The logic is standard. The interesting non-standard features of a nonmonotonic logic are captured by considering whether a given consequence depends on the special predicates. A supposition theory contains formulas of the original language and special axioms governing
Lecture Notes in Computer Science, 2014
An Introduction to Default Logic, 1989
Lecture Notes in Computer Science, 1997
Conditional sentences are a key issue of logical reasoning whose full scope eludes material impli... more Conditional sentences are a key issue of logical reasoning whose full scope eludes material implication. Various authors have proposed logics based on a conditional connective gearing towards specific sentences such as counterfactuals. Unfortunately, most of such conditional logics are propositional and therefore lack expressiveness. We propose in this paper to extend such logics by means of propositional quantification.
Uploads
Papers by Philippe Besnard