National Conference on Artificial Intelligence · 2011 · 14 citations · 15 references
ComputingComputer ScienceMathematicsComputational LinguisticsMemoryNatural Language ProcessingFirst-order LogicLanguage ModelingPredicate Logic
The result of forgetting some predicates in a first-order sentence may not exist in the sense that it might not be captured by any first-order sentences. This, indeed, severely restricts the usage of forgetting in applications. To address this issue, we propose a notion called k-forgetting, also called bounded forgetting in general, for any fixed number k. We present several equivalent characterizations of bounded forgetting and show that the result of bounded forgetting, on one hand, can always be captured by a single first-order sentence, and on the other hand, preserves the information that we are concerned with.
15
Mathematical Social Sciences · 1994 · 3.6K citations
The stable model semantics for logic programming
Michael Gelfond, Vladimir Lifschitz · 1988 · 3.4K citations
Conservative extensions in expressive description logics
Carsten Lutz, Dirk Walther, Frank Wolter · 2007 · 181 citations
Fangzhen Lin, Ray Reiter · Artificial Intelligence · 1997 · 158 citations