110 likes | 234 Views
The Understanding and Translation of KIF and TPTP. Michael Metral CSC410: Project Implementation. What is Logic Reasoning?. Logic reasoning is the basis for proving in-depth logic theorems Foundation for Artificial Intelligence Example: Axioms: All men are mortal Mike is a man
E N D
The Understanding and Translation of KIF and TPTP Michael Metral CSC410: Project Implementation
What is Logic Reasoning? • Logic reasoning is the basis for proving in-depth logic theorems • Foundation for Artificial Intelligence • Example: • Axioms: • All men are mortal • Mike is a man • Conjecture: • Mike is a mortal
Computer Interpretation • For a computer to interpret this type of logic, it needs syntax that is in some order of logic • Types of syntax: • Knowledge Interchange Format (KIF) • Mixture of 1st and 2nd Order logic • Thousands of Problems for Theorem Prover’s (TPTP) – a library of theorems with its own syntax • 1st order logic
KIF to TPTP translator • Adam Pease uses a knowledge base system “Sigma,” and his own fix on KIF known as SUO-KIF • Needs KIF to TPTP translator
Advantages in translating from KIF to TPTP • Current systems as Vampire that use KIF are limited in theorem provability • Broader window of interaction with Automated Theorem Proving (ATP) systems opens up • Barrier between reasoning languages diminishes • More convenient to work with
Disadvantages in translating from KIF to TPTP • Some 2nd order logic syntax cannot be fully translated to 1st order • Semantics of the original KIF language can be lost in the process • Example: • Spanish to English • “You can translate the words, but you can’t always translate the meaning”
Programming Process • Adam requires the translation to be integrated into his system – “new KIF” • With an existing preProcess() method that extracts unnecessary information, we can deal with each individual, necessary token • As we progress through each token of the KIF statement we convert it to a formal TPTP formula
Translation Example • (exists (?X) • (and (lives ?X) • (killed ?X agatha) ) ) • fof(1,axiom,( • ? [X] : • ( lives(X) • & killed(X,agatha) ) )). • Run through tptp4X – syntax checking program – to ensure proper format is used
RemoteSOT • RemoteSOT: java program that remotely connects to the TPTP server to prove theorems in TPTP format • After translation has been made, the incorporation of the RemoteSOT function is also done to give Adam’s Sigma the functionality of proving theorems in the TPTP library
RemoteSOT Functions • Sends requests to run ATP systems for TPTP problems • Runs problems on TPTP server with the given input from the “new KIF” • Returns the corresponding results along with possible recommendations for the given problem