Work

Polynomial-time checking of generalized Sahlqvist syntactic shape

Year: 2024

Type: article

Abstract: The best known modal logics are axiomatized by Sahlqvist axioms, i.e., axioms of a syntactic shape which guarantees these formulas to have such excellent properties as canonicity and elementarity. Recently, the definition of Sahlqvist formulas has been generalized and extended from formulas in classical modal logic to inequalities (sequents) in a wide family of logics known as LE-logics. We introduce an algorithm which checks if a given inequality is generalized Sahlqvist in polynomial time.

Source: Theoretical Computer Science

DOI: 10.1016/j.tcs.2024.114875

Authors: Krishna B. Manoorkar, Alessandra Palmigiano, Mattia Panettiere

Institutions: Vrije Universiteit Amsterdam, University of Johannesburg

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,800

Funder: Nederlandse Organisatie voor Wetenschappelijk Onderzoek