English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

Minimal resolution

MPS-Authors
/persons/resource/persons45719

Weidenbach,  Christoph       
Programming Logics, 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)

MPI-I-94-227.pdf
(Any fulltext), 152KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Weidenbach, C.(1994). Minimal resolution (MPI-I-94-227). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B5AE-7
Abstract
Minimal resolution restricts the applicability of resolution and factorization to minimal literals. Minimality is an abstract criterion. It is shown that if the minimality criterion satisfies certain properties minimal resolution is sound and complete. Hyper resolution, ordered resolution and lock resolution are known instances of minimal resolution. We also introduce new instances of the general completeness result, correct some mistakes in existing literature and give some general redundancy criteria for minimal resolution calculi.