Computing with Logic as Operator Elimination: The ToyElim System

08/24/2011
by   Christoph Wernhard, et al.
0

A prototype system is described whose core functionality is, based on propositional logic, the elimination of second-order operators, such as Boolean quantifiers and operators for projection, forgetting and circumscription. This approach allows to express many representational and computational tasks in knowledge representation - for example computation of abductive explanations and models with respect to logic programming semantics - in a uniform operational system, backed by a uniform classical semantic framework.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2017

Heinrich Behmann's Contributions to Second-Order Quantifier Elimination from the View of Computational Logic

For relational monadic formulas (the Löwenheim class) second-order quant...
research
05/12/2023

Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions

Forgetting is an important concept in knowledge representation and autom...
research
12/03/2017

The Complexity of Satisfiability in Non-Iterated and Iterated Probabilistic Logics

Let L be some extension of classical propositional logic. The non-iterat...
research
10/21/2021

Applying Second-Order Quantifier Elimination in Inspecting Gödel's Ontological Proof

In recent years, Gödel's ontological proof and variations of it were for...
research
06/26/2017

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

Finding solution values for unknowns in Boolean equations was a principa...
research
07/14/2021

Forgetting in Answer Set Programming – A Survey

Forgetting - or variable elimination - is an operation that allows the r...
research
11/13/2018

ABox Abduction via Forgetting in ALC (Long Version)

Abductive reasoning generates explanatory hypotheses for new observation...

Please sign up or login with your details

Forgot password? Click here to reset