A resolution-based calculus for preferential logics

DOI10.1007/978-3-319-94205-6_33MaRDI QIDQ1799110zbMATH OpenOpenAlexFDO

Authors Cláudia Nalon, Dirk Pattinson

Publication date 18 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94205-6_33

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Modal logic (including the logic of norms) (03B45) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Resolution-based calculi for modal and temporal logics
• scientific article; zbMATH DE number 1341615
• scientific article; zbMATH DE number 4055570
• Modal Resolution
• scientific article; zbMATH DE number 4027425

Cited in

(2)

• GL-based calculi for PCL and its deontic cousin
• Proof complexity of modal resolution

Describes a project that uses

Uses Software

• Cool
• leanK
• LoTREC
• Racer
• FaCT++
• E Theorem Prover
• VAMPIRE
• SPASS

This page was built for publication: A resolution-based calculus for preferential logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799110)