New Polynomial Classes for Logic-Based Abduction

06/26/2011
by   B. Zanuttini, et al.
0

We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of abduction problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2009

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions

Abduction is a fundamental and important form of non-monotonic reasoning...
research
07/11/2002

Compilation of Propositional Weighted Bases

In this paper, we investigate the extent to which knowledge compilation ...
research
02/10/2015

On Forgetting in Tractable Propositional Fragments

Distilling from a knowledge base only the part that is relevant to a sub...
research
11/22/2002

Redundancy in Logic I: CNF Propositional Formulae

A knowledge base is redundant if it contains parts that can be inferred ...
research
10/13/2017

Fast Top-k Area Topics Extraction with Knowledge Base

What are the most popular research topics in Artificial Intelligence (AI...
research
06/22/2011

Propositional Independence - Formula-Variable Independence and Forgetting

Independence -- the study of what is relevant to a given problem of reas...
research
09/30/2010

Efficient Knowledge Base Management in DCSP

DCSP (Distributed Constraint Satisfaction Problem) has been a very impor...

Please sign up or login with your details

Forgot password? Click here to reset