ACM Transactions on Computational Logic · 2007 · 58 citations · 32 references
ComputingComputer ScienceFormal MethodsLogicTheory Of ComputationDeductive ReasoningFirst-order LogicProof AssistantsProof ComplexityProof TheoryTheorem ProvingFormal Proof SystemsProof Systems
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.
32
Lecture Notes in Artificial Intelligence
Patrick Brézillon, Paolo Bouquet · 1999 · 7.4K citations
What does a conditional knowledge base entail?
Daniel Lehmann, Menachem Magidor · Artificial Intelligence · 1992 · 838 citations
Uniform proofs as a foundation for logic programming
Dale Miller, Gopalan Nadathur, Frank Pfenning et al. · Annals of Pure and Applied Logic · 1991 · 576 citations
Computing, Computer Science, Logic +16