First‐order Modal Logic Theorem Proving and Functional Simulation

Nonnengart, Andreas

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

First‐order Modal Logic Theorem Proving and Functional Simulation

MPS-Authors

/persons/resource/persons45132

Nonnengart, Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://www.ijcai.org/Proceedings/93-1/Papers/012.pdf
(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

Nonnengart, A. (1993). First‐order Modal Logic Theorem Proving and Functional Simulation. In R. Bajcsy (Ed.), Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence; Chambéry, France, August 28 - September 3, 1993 (pp. 80-85). San Mateo, CA: Morgan Kaufmann.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0023-C7FD-E

Abstract

We propose a translation approach from modal logics to first‐order predicate \u000Alogic which combines advantages from both, the (standard) relational \u000Atranslation and the (rather compact) functional translation method and avoids \u000Amany of their respective disadvantages (exponential growth versus equality \u000Ahandling).\\ In particular in the application to serial modal logics it allows \u000Aconsiderable simplifications such that often even a simple unit clause suffices \u000Ain order to express the accessibility relation properties.\\ Although we \u000Arestrict the approach here to first‐order modal logic theorem proving it has \u000Abeen shown to be of wider interest, as e.g.~sorted logic or terminological \u000Alogic.