Computer Science – Artificial Intelligence
Scientific paper
2009-02-21
Caferra, R. and Salzer, G., eds., Automated Deduction in Classical and Non-Classical Logics (FTP'98), LNAI 1761, pp. 283-298,
Computer Science
Artificial Intelligence
ii + 40 pages
Scientific paper
We present a combination of raising, explicit variable dependency
representation, the liberalized delta-rule, and preservation of solutions for
first-order deductive theorem proving. Our main motivation is to provide the
foundation for our work on inductive theorem proving, where the preservation of
solutions is indispensable.
No associations
LandOfFree
Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized delta-Rule but Without Skolemization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized delta-Rule but Without Skolemization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized delta-Rule but Without Skolemization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-370866