Towards resolution-based reasoning for connected logics

DOI10.1016/j.entcs.2014.06.007zbMath1335.68252OpenAlexW2081809666WikidataQ113317869 ScholiaQ113317869MaRDI QIDQ281156

Cláudia Nalon

Publication date: 10 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.06.007

zbMATH Keywords

theorem proving\(\mathcal{E}\)-connectionsbridge principlesnormal modal logicsresolution method

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Mechanization of proofs and logical operations (03B35)

Uses Software

• DRAGO

Cites Work

• Unnamed Item
• Unnamed Item
• \({\mathcal E}\)-connections of abstract description systems
• Philosophy of logic
• A structure-preserving clause form translation
• Counterfactuals and updates as inverse modalities
• Automated deduction techniques for classification in description logic systems
• Many-dimensional modal logics: theory and applications
• Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design
• Analysis and synthesis of logics. How to cut and paste reasoning systems
• Properties of independently axiomatizable bimodal logics
• Connecting many-sorted theories
• Clausal resolution for normal modal logics
• Journal on Data Semantics I