Artificial Intelligence
A first-order conditional logic for prototypical properties
Artificial Intelligence
An approach to default reasoning based on a first-order conditional logic: revised report
Artificial Intelligence
The logic of nonmonotonicity (research note)
Artificial Intelligence
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
Conditional logics of normality: a modal approach
Artificial Intelligence
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Structure, consequence relation and logic
What is a logical system?
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Basic proof theory
Conditionals: from philosophy to computer science
Conditionals: from philosophy to computer science
Goal-directed proof theory
Plausibility measures and default reasoning
Journal of the ACM (JACM)
Model-Based Diagnosis and Conditional Logic
Applied Intelligence
A Calculus and Complexity Bound for Minimal Conditional Logic
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Free Variable Tableaux for Propositional Modal Logics
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Conditional logic of actions and causation
Artificial Intelligence - Special issue on nonmonotonic reasoning
Weak AGM postulates and strong Ramsey Test: a logical formalization
Artificial Intelligence
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
Analytic tableaux for KLM preferential and cumulative logics
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Shallow Models for Non-iterative Modal Logics
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Tableau calculus for preference-based conditional logics: PCL and its extensions
ACM Transactions on Computational Logic (TOCL)
Generic Modal Cut Elimination Applied to Conditional Logics
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Conditional and Preferential Logics: Proof Methods and Theorem Proving
Proceedings of the 2010 conference on Conditional and Preferential Logics: Proof Methods and Theorem Proving
Optimizing Conditional Logic Reasoning within CoLoSS
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Cut elimination in coalgebraic logics
Information and Computation
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
A conditional constructive logic for access control and its sequent calculus
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Cut elimination for shallow modal logics
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Proof analysis in intermediate logics
Archive for Mathematical Logic
Nested sequent calculi for conditional logics
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Sequent systems for lewis' conditional logics
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Embedding and automating conditional logics in classical higher-order logic
Annals of Mathematics and Artificial Intelligence
Automating quantified conditional logics in HOL
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics. The calculus uses labels and transition formulas and can be used to prove decidability and space complexity bounds for the respective logics. We also show that these calculi can be the base for uniform proof systems. Moreover, we present CondLean, a theorem prover in Prolog for these calculi.