-
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Abduction is a fundamental and important form of non-monotonic reasoning...
12/16/2009 ∙ by Nadia Creignou, et al. ∙
0
∙
share
read it
-
On Forgetting in Tractable Propositional Fragments
Distilling from a knowledge base only the part that is relevant to a sub...
02/10/2015 ∙ by Yisong Wang, et al. ∙
0
∙
share
read it
-
Compilation of Propositional Weighted Bases
In this paper, we investigate the extent to which knowledge compilation ...
07/11/2002 ∙ by Adnan Darwiche, et al. ∙
0
∙
share
read it
-
Fast Top-k Area Topics Extraction with Knowledge Base
What are the most popular research topics in Artificial Intelligence (AI...
10/13/2017 ∙ by Fang Zhang, et al. ∙
0
∙
share
read it
-
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very impor...
09/30/2010 ∙ by Hong Jiang, et al. ∙
0
∙
share
read it
-
Redundancy in Logic I: CNF Propositional Formulae
A knowledge base is redundant if it contains parts that can be inferred ...
11/22/2002 ∙ by Paolo Liberatore, et al. ∙
0
∙
share
read it
-
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
Logic-based argumentation is a well-established formalism modelling nonm...
02/23/2021 ∙ by Yasir Mahmood, et al. ∙
9
∙
share
read it
New Polynomial Classes for Logic-Based Abduction
06/26/2011 ∙ by B. Zanuttini, et al. ∙
0
∙
share
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
Comments
There are no comments yet.