Tractable inference systems: an extension with a deducibility predicate

DOI10.1007/978-3-642-38574-2_6MaRDI QIDQ4928430zbMATH OpenOpenAlexFDO

Authors Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri

Publication date 14 June 2013

Published in Automated Deduction – CADE-24 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38574-2_6

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Deducibility constraints
• scientific article; zbMATH DE number 1696743
• Automatic recognition of tractability in inference relations
• Extending \({\mathcal H}_1\)-clauses with path disequalities
• Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses

Cited in

(4)

• Deducibility constraints
• Automatic recognition of tractability in inference relations
• Iterative Specialisation of Horn Clauses
• Propositional logics of overwhelming truth

Describes a project that uses

Uses Software

• EasyCrypt

This page was built for publication: Tractable inference systems: an extension with a deducibility predicate

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