Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

Abstract Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a
first-order formula with respect to some decidable first-order theory T (SMT (T)). These …

Publisher Summary Mathematical logicians had developed the art of formalizing declarative
knowledge long before the advent of the computer age. But they were interested primarily in …

A major goal of this thesis is the ability to determine the correctness of graphical
specifications consisting of a graph precondition, a graph program and graph postcondition …

Inst-Gen is an instantiation-based reasoning method for first-order logic introduced in [18].
One of the distinctive features of Inst-Gen is a modular combination of first-order reasoning …

Recent years have seen considerable interest in procedures for computing finite models of
first-order logic specifications. One of the major paradigms, MACE-style model building, is …

We describe an algorithm for deciding the first-order multisorted theory BAPA, which
combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger …

Incremental determinization is a recently proposed algorithm for solving quantified Boolean
formulas with one quantifier alternation. In this paper, we formalize incremental …

We apply the framework of Bachmair and Ganzinger for saturation-based theorem proving to
derive a range of decision procedures for logical formalisms, starting with a simple …

Darwin is the first implementation of the Model Evolution Calculus by Baumgartner and
Tinelli. The Model Evolution Calculus lifts the DPLL procedure to first-order logic. Darwin is …