scholarly journals Logical derivation search with assumption traceability

2021 ◽  
Vol 62 ◽  
pp. 16-22
Author(s):  
Adomas Birštunas ◽  
Elena Reivytytė
Keyword(s):  
Knowledge Base ◽  
Propositional Logic ◽  
Logical Derivation ◽  
Formula Derivation ◽  
Derivation Procedure

In this paper authors research the problem of traceability of assumptions in logical derivation. The essence of this task is to trace which assumptions from the available knowledge base of assumptions are necessary to derive a certain conclusion. The paper presents a new derivation procedure for propositional logic, which ensures traceability feature. For the derivable conclusion formula derivation procedure also returns the smallest set of assumptions those are enough to get derivation of the conclusion formula. Verification of the procedure were performed using authors implementation.

KNOWLEDGE BASE REFORMATION: PREPARING FIRST-ORDER THEORIES FOR EFFICIENT PROPOSITIONAL REASONING

2000 ◽  
Vol 14 (01) ◽  
pp. 35-57 ◽  
Author(s):  
HELMUT PRENDINGER ◽  
MITSURU ISHIZUKA ◽  
GERHARD SCHURZ
Keyword(s):  
Knowledge Base ◽  
Propositional Logic ◽  
Knowledge Compilation ◽  
First Order ◽  
Order Language

We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since the most efficient reasoning methods are defined for propositional logic, while knowledge is most conveniently expressed within a first-order language. To obtain compact propositional representations, we employ techniques from (ir)relevance reasoning as well as theory transformation via unfold/fold transformations. Application areas include diagnosis, planning, and vision. Preliminary experiments with a hypothetical reasoner indicate that our method may yield significant speed-ups.

scholarly journals New Polynomial Classes for Logic-Based Abduction

2003 ◽  
Vol 19 ◽  
pp. 1-10 ◽  
Author(s):  
B. Zanuttini
Keyword(s):  
Knowledge Base ◽  
Propositional Logic ◽  
Propositional Knowledge ◽  
General Algorithm ◽  
Propositional Knowledge Base

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.

Knowledge-Based Description Logic ALCO Knowledge Compiled Algorithm to Determine Consistency

2012 ◽  
Vol 487 ◽  
pp. 347-351
Author(s):  
Ya Qiong Jiang ◽  
Jun Wang
Keyword(s):  
Normal Form ◽  
Knowledge Base ◽  
Propositional Logic ◽  
Description Logic ◽  
Knowledge Bases ◽  
Knowledge Compilation ◽  
Knowledge Based ◽  
Common Technique ◽  
Compilation Techniques

Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which reasoning can be answered efficiently. The precompilation of description logic knowledge base is important for reasoning and services of description logic. This paper gives precompilation about the description logic ALCO TBox based on knowledge compilation techniques, for which the consistency of TBox can be determined.

WinFriends: Building your English Knowledge-Base (Version 5.02)

2017 ◽  
Vol 20 (1) ◽  
pp. 208-220
Author(s):  
J. F. Coll
Keyword(s):  
Knowledge Base
Sign in / Sign up

Export Citation Format

Share Document