JAR
1998
13 years 11 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
JAR
1998
13 years 11 months ago
1998
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
JAR
1998
13 years 11 months ago
1998
JAR
1998
13 years 11 months ago
1998
In [6] Besnard and Schaub elaborated a novel approach to paraconsistent reasoning which lead to a family of paraconsistent consequence relations. In a sense these try to safeguard...