scientific article; zbMATH DE number 1301750

MaRDI QIDQ4246965zbMATH OpenFDO

Authors François Bry, Sunna Torge

Publication date 12 January 2000

zbMATH Keywords

automated reasoningexistential quantifiersfinite satisfiabilityrefutation complete deduction method

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 4049135
• Methods for proving completeness via logical reductions
• scientific article; zbMATH DE number 4088977
• scientific article; zbMATH DE number 1323296
• Proving refutational completeness of theorem-proving strategies
• A generalisation of a refutation-related method in paraconsistent logics
• scientific article; zbMATH DE number 7699443
• Publication:4731166
• Complete problems for fixed-point logics
• scientific article; zbMATH DE number 1761886

Cited in

(10)

• Computing finite models by reduction to function-free clause logic
• Blocking and other enhancements for bottom-up model generation methods
• Exploring theories with a model-finding assistant
• Individual Reuse in Description Logic Reasoning
• scientific article; zbMATH DE number 4088977 (Why is no real title available?)
• Using tableau to decide description logics with full role negation and identity
• A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
• scientific article; zbMATH DE number 970704 (Why is no real title available?)
• Theorem proving techniques for view deletion in databases
• Refutation systems: an overview and some applications to philosophical logics

Describes a project that uses

Uses Software

• FINDER
• TPTP
• SATCHMO

This page was built for publication:

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