Nested Proof Compilation and Proof Checking in Universal Pattern Logic

Authors:
Wuming Pan;Bing Guo
Affiliations:
College of Computer Science, Sichuan University, Chengdu, P.R. China 610065;College of Computer Science, Sichuan University, Chengdu, P.R. China 610065
Venue:
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Year:
2009

Citing 5
Cited 0

Modal logic

Modal logic
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Logical frameworks

Handbook of automated reasoning
Proof-assistants using dependent type systems

Handbook of automated reasoning
Proof-carrying code from certified abstract interpretation and fixpoint compression

Theoretical Computer Science - Applied semantics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss the connections between proofs in logics with axiomatic deduction system and the deduction problems of a logic called first order universal pattern logic (UPL-1). We propose a method which can efficiently convert proofs in axiomatic logics to formula sequences in UPL-1 whereby we can check the validity of the proofs, and then a decidable proof checking approach is sketched out.