DeepAI AI Chat
Log In Sign Up

Extending Prolog for Quantified Boolean Horn Formulas

by   Anish Mallick, et al.

Prolog is a well known declarative programming language based on propositional Horn formulas. It is useful in various areas, including artificial intelligence, automated theorem proving, mathematical logic and so on. An active research area for many years is to extend Prolog to larger classes of logic. Some important extensions of it includes the constraint logic programming, and the object oriented logic programming. However, it cannot solve problems having arbitrary quantified Horn formulas. To be precise, the facts, rules and queries in Prolog are not allowed to have arbitrary quantified variables. The paper overcomes this major limitations of Prolog by extending it for the quantified Boolean Horn formulas. We achieved this by extending the SLD-resolution proof system for quantified Boolean Horn formulas, followed by proposing an efficient model for implementation. The paper shows that the proposed implementation also supports the first-order predicate Horn logic with arbitrary quantified variables. The paper also introduces for the first time, a declarative programming for the quantified Boolean Horn formulas.


page 1

page 2

page 3

page 4


Synthesis with Explicit Dependencies

Quantified Boolean Formulas (QBF) extend propositional logic with quanti...

Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas

Resolution is the rule of inference at the basis of most procedures for ...

A Critique of Sopin's "PH = PSPACE"

We critique Valerii Sopin's paper "PH = PSPACE" [Sop14]. The paper clai...

Model Generation for Quantified Formulas: A Taint-Based Approach

We focus in this paper on generating models of quantified first-order fo...

Understanding and Extending Incremental Determinization for 2QBF

Incremental determinization is a recently proposed algorithm for solving...

Synthesis of Boolean Functions with Clausal Abstraction

Dependency quantified Boolean formulas (DQBF) is a logic admitting exist...

New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs

We propose two models of random quantified boolean formulas and their na...