SCAN -- elimination of predicate quantifiers

DOI10.1007/3-540-61511-3_77MaRDI QIDQ4647510zbMATH OpenOpenAlexFDO

Authors Hans Jürgen Ohlbach

Publication date 15 January 2019

Published in Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61511-3_77

zbMATH Keywords

correspondence theoryintuitionistic logicpredicate logicpredicate variableProlog programquantifier elimination

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• Relational and Kleene-Algebraic Methods in Computer Science
• Second-order quantifier elimination. Foundations, computational aspects and applications
• scientific article; zbMATH DE number 1421198
• scientific article; zbMATH DE number 1931662
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

Cites work

• Computing circumscription revisited: A reduction algorithm
• Otter 2.0
• Untersuchungen über das Eliminationsproblem der mathematischen Logik

Cited in

(7)

• Second-order quantifier elimination. Foundations, computational aspects and applications
• scientific article; zbMATH DE number 1421198 (Why is no real title available?)
• SAT-Inspired Eliminations for Superposition
• SAT-Inspired Higher-Order Eliminations
• Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
• An abstract fixed-point theorem for Horn formula equations
• Reconsideration of circumscriptive induction with pointwise circumscription

This page was built for publication: SCAN -- elimination of predicate quantifiers

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