The Boolean Solution Problem from the Perspective of Predicate Logic (Abstract)

@inproceedings{Wernhard2017TheBS,
  title={The Boolean Solution Problem from the Perspective of Predicate Logic (Abstract)},
  author={Christoph Wernhard},
  booktitle={SOQE},
  year={2017}
}
  • C. Wernhard
  • Published in SOQE 27 September 2017
  • Computer Science
Finding solution values for unknowns in Boolean equations was a principal reasoning mode in the Algebra of Logic of the 19th century. Schroder investigated it as Auflosungsproblem (solution problem). It is closely related to the modern notion of Boolean unification. Today it is commonly presented in an algebraic setting, but seems potentially useful also in knowledge representation based on predicate logic. We show that it can be modeled on the basis of first-order logic extended by second… 

The Boolean Solution Problem from the Perspective of Predicate Logic - Extended Version

TLDR
It is shown that finding solution values for unknowns in Boolean equations can be modeled on the basis of first-order logic extended by second-order quantification, and some cases that allow constructions are identified, most of them based on Craig interpolation.

A Fixed-point Theorem for Horn Formula Equations

TLDR
This section outlines how the semantics of model abstractions and secondorder-formulas φ are expected to apply to the fixedpoint theorem and defines a satisfaction relation (M ,G) |=a φ .

Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic

TLDR
PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic that supports a workflow based on documents that intersperse macro definitions, invocations of reasoners, and LaTeX-formatted natural language text.

Approximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas

TLDR
Second-order quantifier elimination is investigated for a class of formulas characterized by a restriction on the quantifier prefix: existential predicate quantifiers followed by universal individual quantifiers and a relational matrix to derive properties such as co-recursively enumerable.

References

SHOWING 1-10 OF 37 REFERENCES

The Boolean Solution Problem from the Perspective of Predicate Logic - Extended Version

TLDR
It is shown that finding solution values for unknowns in Boolean equations can be modeled on the basis of first-order logic extended by second-order quantification, and some cases that allow constructions are identified, most of them based on Craig interpolation.

Quantifier Elimination in Second-Order Predicate Logic

An algorithm is presented which eliminates second–order quantifiers over predicate variables in formulae of type ∃P1, . . . , Pnψ where ψ is an arbitrary formula of first–order predicate logic. The

Computing Circumscription Revisited: A Reduction Algorithm

TLDR
This article provides a general method that can be used in an algorithmic manner to reduce certain circumscription axioms to first-order formulas and demonstrates the generality of the algorithm using circumscriptive theories with mixed quantifiers, variable constants, nonseparated formulas, and formulas with n-ary predicate variables.

Embedding Boolean Expressions into Logic Programming

Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications

TLDR
This book provides the first comprehensive, systematic and uniform account of the state-of-the-art of second-order quantifier elimination in classical and non-classical logics.

Boolean constraints in SICStus Prolog

TLDR
The implementation of a Boolean constraint solver and its integration with a Prolog engine is documents, and various optimizations of the Boolean unification algorithm are investigated, and a preliminary performance evaluation is included.

Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

TLDR
This paper introduces a new algorithm, SQEMA, for computing first-order equiva- lents (using a modal version of Ackermann's lemma) and proves its correctness and the canonicity of all formulae on which the algorithm succeeds, establishing one of the most general completeness results in modal logic so far.

On the Complexity of Boolean Unification

  • F. Baader
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 1998

Concept Forgetting for ALCOI-Ontologies using an Ackermann Approach

TLDR
The method is an adaptation and improvement of a second-order quantifier elimination method developed for modal logics and used for computing correspondence properties formodal axioms and can handle inverse roles, nominals and ABoxes.