Making believers out of computers
Artificial Intelligence
Inferring negative information from disjunctive databases
Journal of Automated Reasoning
All I know: a study in autoepistemic logic
Artificial Intelligence
Logic programs with classical negation
Logic programming
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Answer set programming's contributions to classical logic: an analysis of ASP methodology
Logic programming, knowledge representation, and nonmonotonic reasoning
Manifold answer-set programs and their applications
Logic programming, knowledge representation, and nonmonotonic reasoning
Revisiting epistemic specifications
Logic programming, knowledge representation, and nonmonotonic reasoning
The Logic Of Only Knowing As A Unified Framework For Non-Monotonic Reasoning
Fundamenta Informaticae
| Hi-index | 0.00 |
The purpose of this paper is to expand the syntax and semantics of logic programs and deductive databases to allow for the correct representation of incomplete information in the presence of multiple extensions. The language of logic programs with classical negation, epistemic disjunction, and negation by failure is further expanded by a new modal operator K (where for the set of rules T and formula F, KF stands for "F is known to a reasoner with a set of premises T"). Theories containing such an operator will be called strongly introspective. We will define the semantics of such theories (which expands the semantics of deductive databases from [Gelfond and Lifschitz 1990bD and demonstrate the applicability of strongly introspective theories to formalization of some forms of commonsense reasoning.