The triguarded fragment of first-order logic
DOI10.29007/M8TSzbMATH Open1416.03008OpenAlexW2908208955MaRDI QIDQ5222982FDOQ5222982
Authors: Sebastian Rudolph, Mantas Šimkus
Publication date: 4 July 2019
Published in: EPiC Series in Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.29007/m8ts
Recommendations
complexitydecidabilitymodal logicdescription logicsguarded fragmenttwo-variable fragmentfragments of first-order logic
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25)
Cited In (7)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
- STACS 2005
- Deciding regular grammar logics with converse through first-order logic
- Title not available (Why is that?)
- Means and limits of decision (invited talk)
- Finite model theory of the triguarded fragment and related logics
- Conservative extensions in guarded and two-variable fragments
This page was built for publication: The triguarded fragment of first-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222982)