DocumentCode
547312
Title
A prime implicates-based formulae forgetting
Author
Xu, Dai ; Lin, Zuoquan
Author_Institution
Dept. of Inf. Sci., Peking Univ., Beijing, China
Volume
3
fYear
2011
fDate
10-12 June 2011
Firstpage
128
Lastpage
132
Abstract
This paper proposes a novel operation called formulae forgetting by extending literals forgetting, which is popular in reasoning about knowledge, to ignore or hide those irrelevant formulae for given tasks. First, prime implicates are employed to capture variables forgetting and literals forgetting; and literals forgetting could be taken as particular cases of formulae forgetting. Clauses forgetting are then introduced to build a uniform framework for variables forgetting via prime implicates. Based on this uniform framework, a formula could be forgotten by using clauses forgetting on the resolution closure of all prime implicates of the formula. As an extension of variables forgetting, formulae forgetting might be more flexible in reasoning about knowledge since formulae are the most general forms of knowledge. In technology, our operator for formulae forgetting is based on prime implicates and clauses forgetting while variables forgetting is simply based on variables assignment. In addition, our operator could keep the syntax-independency which is an important semantic feature in representing knowledge.
Keywords
Prime computers; cognition; knowledge representation; formulae forgetting; knowledge representation; literals forgetting; reasoning about knowledge; resolution closure; syntax-independency; Artificial intelligence; Cognition; Contracts; Information science; Joints; Reactive power; Semantics; clauses forgetting; formula forgetting; literals forgetting; prime implicate; variables forgetting;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-8727-1
Type
conf
DOI
10.1109/CSAE.2011.5952649
Filename
5952649
Link To Document