Generalized Completeness for SOS Resolution and its Application to a New Notion 
of Relevance

Haifani, Fajar; Tourret, Sophie; Weidenbach, Christoph

doi:10.1007/978-3-030-79876-5_19

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Generalized Completeness for SOS Resolution and its Application to a New Notion of Relevance

MPS-Authors

/persons/resource/persons252912

Haifani, Fajar
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons217397

Tourret, Sophie
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

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

Haifani2021_Chapter_GeneralizedCompletenessForSOSR.pdf
(Publisher version), 382KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Haifani, F., Tourret, S., & Weidenbach, C. (2021). Generalized Completeness for SOS Resolution and its Application to a New Notion of Relevance. In A. Platzer, & G. Sutcliffe (Eds.), Automated Deduction - CADE 28 (pp. 327-343). Berlin: Springer. doi:10.1007/978-3-030-79876-5_19.

Cite as: https://hdl.handle.net/21.11116/0000-0009-3F8D-3

Abstract

There is no abstract available