Abstract
This is an effort towards an abstract presentation of the formal properties of the way we tend to jump to conclusions from less than fully convincing information. In [6], such properties were presented as families of binary relations between propositional formulas, i.e., built out of preexisting propositional logic. Though the family of cumulative relations is easily amenable to an abstract presentation that does not use the propositional connectives, as was noticed in [8] and [9], no such presentation is known for the more attractive family of preferential relations. Plausibility Logic is a step towards such an abstract presentation. It enables the definition of connectives: each connective is defined by introduction rules only. It provides a nonmonotonic presentation of the Gentzen’s consequence relation of classical logic. But, no representation theorem is known for Plausibility Logic and it does not enjoy Cut Elimination.
Original language | English |
---|---|
Title of host publication | Computer Science Logic - 5th Workshop, CSL 1991, Proceedings |
Editors | Egon Borger, Gerhard Jager, Hans Kleine Buning, Michael M. Richter |
Publisher | Springer Verlag |
Pages | 227-241 |
Number of pages | 15 |
ISBN (Print) | 9783540557890 |
DOIs | |
State | Published - 1992 |
Event | 5th Workshop on Computer Science Logic, CSL 1991 - Berne, Switzerland Duration: 7 Oct 1991 → 11 Oct 1991 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 626 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 5th Workshop on Computer Science Logic, CSL 1991 |
---|---|
Country/Territory | Switzerland |
City | Berne |
Period | 7/10/91 → 11/10/91 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1992.