A general setting for flexibly combining and augmenting decision procedures

DOI10.1023/A:1015707001763zbMath1003.03012OpenAlexW1656633205MaRDI QIDQ1610671

Predrag Janičić, Alan Bundy

Publication date: 20 August 2002

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015707001763

zbMATH Keywords

theorem provingefficient combining and augmenting of decision procedures

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (4)

An integrated approach to high integrity software verification ⋮ Quantifier Elimination and Provers Integration ⋮ Learning Strategies for Mechanised Building of Decision Procedures ⋮ Model-theoretic methods in combined constraint satisfiability

Uses Software

• PVS

This page was built for publication: A general setting for flexibly combining and augmenting decision procedures