Help Privacy Policy Disclaimer
  Advanced SearchBrowse





System Description: H-PILoT (Version 1.9)


Ihlemann,  Carsten
Automation of Logic, MPI for Informatics, Max Planck Society;


Sofronie-Stokkermans,  Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Ihlemann, C., & Sofronie-Stokkermans, V.(2010). System Description: H-PILoT (Version 1.9) (ATR61). SFB/TR 14 AVACS.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-14C5-2
This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions), a program for hierarchical reasoning in extensions of logical theories. H-PILoT reduces deduction problems in the theory extension to deduction problems in the base theory. Specialized provers and standard SMT solvers can be used for testing the satisfiability of the formulae obtained after the reduction. For a certain type of theory extension (namely for {\em local theory extensions}) this hierarchical reduction is sound and complete and -- if the formulae obtained this way belong to a fragment decidable in the base theory -- H-PILoT provides a decision procedure for testing satisfiability of ground formulae, and can also be used for model generation.