Abstract:
We develop a general closure semantics for deduction rules in knowledge bases, using the concept of a (deductive) knowledge system proposed in [Wag94a] where rules are interpreted as update functions operating on knowledge bases. We first present four important examples of basic knowledge systems: relational databases, (defeasible) factbases, temporal databases, and epistemic states. We then define the notion of a supported closure, and we show that every ampliative deductive knowledge base has a supported closure. Choosing those supported closures which satisfy a certain stability condition as the preferred (or intended) ones we obtain the stable closure semantics for deductive knowledge bases (including normal, extended, disjunctive, and other logic programming and rule-based systems). Contents 1 Introduction 2 2 Basic Concepts 3 2.1 Knowledge Systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.2 Regular Knowledge Systems : : : : : : : : : : : : : : : ...
Citations
|
604
|
The semantics of Predicate Logic as a Programming Language
– Emden, Kowalski
- 1976
|
|
567
|
Classical Negation in Logic Programs and Disjunctive Databases
– Gelfond, Lifschitz
|
|
542
|
Towards a Theory of Declarative Knowledge
– Apt, Blair, et al.
- 1988
|
|
292
|
Logic Programs with classical negation
– Gelfond, Lifschitz
- 1990
|
|
229
|
Knowledge in Flux
– Gärdenfors
- 1987
|
|
225
|
A Useful Four-Valued Logic
– Belnap
- 1977
|
|
188
|
Logic Programming and Knowledge Representation
– BARAL, GELFOND
- 1994
|
|
158
|
Theoretical Foundations for Non-monotonic Reasoning in Expert Systems." Appearing in
– Gabbay
- 1985
|
|
122
|
Foundations of a functional approach to knowledge representation
– Levesque
- 1984
|
|
55
|
Safety and translation of relational calculus queries
– Gelder, Topor
- 1991
|
|
40
|
A database needs two kinds of negation
– Wagner
- 1991
|
|
35
|
The Stable Model Semantics for Logic
– Gelfond, Lifschitz
- 1988
|
|
35
|
Reasoning about truth
– Priest
- 1989
|
|
23
|
Vivid Logic -- Knowledge-Based Reasoning with Two Kinds of Negation
– Wagner
- 1993
|
|
22
|
Continuous lattices, Toposes, Algebraic Geometry and Logic
– Scott
- 1972
|
|
15
|
Negation by default and unstrati logic programs
– Bidoit, N
- 1991
|
|
8
|
Semantics for disjunctive logic programs with explicit and default negation
– Minker, Ruiz
- 1994
|
|
8
|
Answer sets and constructive logic, II: Extended logic programs and related nonmonotonic formalisms
– Pearce
- 1993
|
|
6
|
From information systems to knowledge systems
– Wagner
- 1995
|
|
5
|
On the declarative semantics of logic programs with negation
– Przymusinski
|
|
4
|
Transforming deductive into active databases
– Wagner
- 1994
|
|
3
|
Disjunctive Fact Bases and Logic Programming -- Preliminary Report
– Wagner
- 1993
|
|
2
|
Belnap's Epistemic States and Negation-as-Failure
– Wagner
- 1994
|