DeepAI AI Chat
Log In Sign Up

Querying Guarded Fragments via Resolution

by   Sen Zheng, et al.

The problem of answering Boolean conjunctive queries over the guarded fragment is decidable, however, as yet no practical decision procedure exists. In this paper, we present a resolution-based decision procedure to address this problem, and further extend the decision procedure to the loosely guarded fragment. In particular, we show that using a separation rule and top-variable-based techniques, one can rewrite Boolean conjunctive queries into a set of (loosely) guarded clauses, so that querying the (loosely) guarded fragment can be reduced to deciding the (loosely) guarded fragment. As far as we know, this is the first practical decision procedure for answering Boolean conjunctive queries over the guarded fragment and the loosely guarded fragment.


page 1

page 2

page 3

page 4


Deciding the Loosely Guarded Fragment and Querying Its Horn Fragment Using Resolution

We consider the following query answering problem: Given a Boolean conju...

Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments

Answering Boolean conjunctive query over logical constraints is an essen...

On the Computational Intelligibility of Boolean Classifiers

In this paper, we investigate the computational intelligibility of Boole...

Well-Scaling Procedure for Deciding Gammoid Class-Membership of Matroids

We introduce a procedure that solves the decision problem whether a give...

Variable Shift SDD: A More Succinct Sentential Decision Diagram

The Sentential Decision Diagram (SDD) is a tractable representation of B...

Bayesian Assessment of a Connectionist Model for Fault Detection

A previous paper [2] showed how to generate a linear discriminant networ...

Deciding boundedness of monadic sirups

We show that deciding boundedness (aka FO-rewritability) of monadic sing...