{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T20:11:25Z","timestamp":1716927085648},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1995,6]]},"abstract":"<jats:p> The Dempster-Shafer theory of evidence can be conceived as a theory of probability of provability. In fact, it has been shown that evidence theory can be developed on the basis of assumption-based reasoning. Taking this approach, reasoning is modeled in this paper by a consequence relation in the sense of Tarski. It is shown that it is possible to construct evidence theory on top of the very general logics defined by these consequence relations. Support functions can be derived which are, as usual, set functions, monotone of infinite order. Furthermore, plausibility functions can also be defined. However, as negation need not be defined in these general logics, the usual duality relations between support and plausibility functions of Dempster-Shafer theory do not hold in general. Nonetheless, this symmetry can be installed progressively by considering logics that enjoy more and more \u201cstructural properties\u201d. <\/jats:p>","DOI":"10.1142\/s0129054195000093","type":"journal-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T11:59:25Z","timestamp":1100260765000},"page":"119-135","source":"Crossref","is-referenced-by-count":11,"title":["EVIDENCE THEORY BASED ON GENERAL CONSEQUENCE RELATIONS"],"prefix":"10.1142","volume":"06","author":[{"given":"PHILIPPE","family":"BESNARD","sequence":"first","affiliation":[{"name":"Irisa, Campus de Beaulieu, 35042 Rennes C\u00e9dex, France"}]},{"given":"J\u00dcRG","family":"KOHLAS","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Fribourg, 1700 Fribourg, Switzerland"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054195000093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:44:28Z","timestamp":1565138668000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054195000093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1995,6]]}},"alternative-id":["10.1142\/S0129054195000093"],"URL":"https:\/\/doi.org\/10.1142\/s0129054195000093","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}