Abstract
Starting from assumption-based propositional knowledge bases, a symbolic evidence theory3 can be developed. This theory is the qualitative equivalent of the well known numerical Dempster-Shafer theory of evidence5. Given a propositional knowledge base and some additional facts or observations, the problem is to compute the quasi-supports, the contradictions and the supports in a symbolic form for one or a few hypotheses. The main advantage of this approach is that symbolic supports are pure arguments in favour or against certain hypotheses and they can be transformed into linguistic explanations.
Research supported by grants No. 21-30186.90 and 21-32660.91 of the Swiss National Foundation for Research, Esprit Basic Research Activity Project DRUMSII (Defeasible Reasoning and Uncertainty Managment).
This is a short summary of the actual state of a research work which will be published later as a part of the author’s Ph.D. thesis. The mathematical foundations and most of the theoretical background are published by Kohlas3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. Colmerauer and F. Benhamou, “Prolog III”, AFCET Ecole Internationale d’Informatique, XXème Session, Université d’Aix-Marseille II, Luminy, France (1990).
U. Hänni, Computing Symbolic Support Functions by Classical Theorem-Proving Techniques, to be published in: “Mathematical Models for Handling Partial Knowledge in A.I.” (G. Coletti and R. Scozzafava, Eds. ), Plenum Publishing Co. (1994).
J. Kohlas, Symbolic Evidence, Arguments, Supports and Valuation Networks, in: “Symbolic and Quantitative Approaches to Reasoning and Uncertainty”, pages 186–198, Springer (1993).
R. Reiter and J. De Kleer, Foundations of Assumption-based Truth Maintenance Systems, Preliminary Report, in: “Proc. Amer. Assoc. A.I.”, pages 183–188, (1987).
G. Shafer, “A Mathematical Theory of Evidence”, Princeton University Press, Princeton, N.J. (1976).
P.P. Shenoy, Valuation Networks and Conditional Independence, in: “Uncertainty in Artificial Intelligence, Proceeding of the 9th Conference” ( D. Heckermann and E. Mamdani, Eds.), pages 191–199, Morgan Kaufmann Publishers, Inc. (1993).
P. Siegel, “Représentation et Utilisation de la Connaissance en Calcul Propositionel”, Ph.D. thesis, Université d’Aix-Marseille II, Luminy, France (1987).
R.E. Tarjan and M. Yannakakis, Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, in: SIAM J. Computing, 13:566–579 (1981).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Haenni, R. (1995). A Valuation-Based Architecture for Assumption-Based Reasoning. In: Coletti, G., Dubois, D., Scozzafava, R. (eds) Mathematical Models for Handling Partial Knowledge in Artificial Intelligence. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-1424-8_16
Download citation
DOI: https://doi.org/10.1007/978-1-4899-1424-8_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-1426-2
Online ISBN: 978-1-4899-1424-8
eBook Packages: Springer Book Archive