English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Soft Typing for Ordered Resolution

MPS-Authors
/persons/resource/persons44474

Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44784

Meyer,  Christoph
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach,  Christoph       
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dwqly
(Publisher version)

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
Citation

Ganzinger, H., Meyer, C., & Weidenbach, C. (1997). Soft Typing for Ordered Resolution. In W. McCune (Ed.), Automated Deduction - CADE-14 (pp. 321-335). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3A13-B
Abstract
We propose a variant of ordered resolution with semantic restrictions
based on interpretations which are identified by the given atom ordering
and selection function. Techniques for effectively approximating validity
in these interpretations are described that are related to methods of
soft typing for programming languages.
The framework is shown to be strictly more general than certain related
methods.
Implementation in the \spass\ prover has lead to encouraging experimental
results.