scientific article; zbMATH DE number 1301750

MaRDI QIDQ4246965zbMATHFDO

Authors François Bry, Sunna Torge

Publication date 12 January 2000

zbMATH Keywords

automated reasoningfinite satisfiabilityexistential quantifiersrefutation complete deduction method

Mathematics Subject Classification ID

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

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

Describes a project that uses

Uses Software

• TPTP
• FINDER
• 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)