A Calculus and Complexity Bound for Minimal Conditional Logic

Authors:
Nicola Olivetti;Camilla Schwind
Affiliations:
-;-
Venue:
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Year:
2001

Citing 8
Cited 3

Counterfactuals

Artificial Intelligence
A first-order conditional logic for prototypical properties

Artificial Intelligence
Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
Conditional logics of normality: a modal approach

Artificial Intelligence
Conditionals: from philosophy to computer science

Conditionals: from philosophy to computer science
Belief Revision: A Critique

Journal of Logic, Language and Information
A Conditional Logic for Belief Revision

JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations

TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

A sequent calculus and a theorem prover for standard conditional logics

ACM Transactions on Computational Logic (TOCL)
Cut elimination for shallow modal logics

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
CondLean 3.0: improving CondLean for stronger conditional logics

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a cut-free sequent calculus for minimal conditional logic CK and three extensions of it: namely, with ID, MP and both of them. The calculus uses labels and transition formulas and can be used to prove decidability and space complexity bounds for the respective logics. As a first result, we show that CK can be decided in O(n log n) space.