A three-valued semantics for deductive databases and logic programs

Authors:
Jia-Huai You;Li Yan Yuan
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1994

Citing 18
Cited 16

Nonmonotonic logic and temporal projection

Artificial Intelligence
Negation in logic programming

Journal of Logic Programming
The anomalous extension problem in default reasoning

Artificial Intelligence
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs

Foundations of deductive databases and logic programming
On the declarative semantics of logic programs with negation

Foundations of deductive databases and logic programming
An algorithm to compute circumscription

Artificial Intelligence
On the declarative and procedual semantics of logic programs

Journal of Automated Reasoning
The alternating fixpoint of logic programs with negation

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Every logic program has a natural stratification and an iterated least fixed point model

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A procedural semantics for well founded negation in logic programs

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming as constructivism: a formalization and its application to databases

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Discriminant circumscription

FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Three-valued formalizations of non-monotonic reasoning and logic programming

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Modular stratification and magic sets for DATALOG programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Three-valued formalization of logic programming: is it needed?

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unfounded sets and well-founded semantics for general logic programs

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)

Logic programming and knowledge representation-the A-prolog perspective

Artificial Intelligence
On the partial semantics for disjunctive deductive databases

Annals of Mathematics and Artificial Intelligence
Abduction in logic programming: a new definition and an abductive procedure based on rewriting

Artificial Intelligence
Coherence Approach to Logic Program Revision

IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints

IEEE Transactions on Knowledge and Data Engineering
Disjunctive Logic Programming: A Survey and Assessment

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Capturing Stationary and Regular Extensions with Reiter's Extensions

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Unfolding partiality and disjunctions in stable model semantics

ACM Transactions on Computational Logic (TOCL)
Solving logic program conflict through strong and weak forgettings

Artificial Intelligence
On odd and even cycles in normal logic programs

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A meta-programming technique for debugging answer-set programs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms

Theory and Practice of Logic Programming
Solving logic program conflict through strong and weak forgettings

Artificial Intelligence
Logic programming for Boolean networks

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Oscillating behavior of logic programs

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes two principles, justifiability and minimal undefinedness, for a three-valued model-theoretic approach to semantics of logic programs and deductive databases (also called disjunctive logic programs). The former is intimately related to the concept of labeling-based justification in Doyle's truth maintenance system while the latter requires the use of the truth value undefined only when it is necessary. We examine the question why and in what circumstances the undefined is needed under these two principles. We show that these two principles yield a declarative semantics for deductive databases and logic programs, which is called the regular model semantics. Program properties in this semantics are analyzed and results obtained concerning the relationship among regular, stable, and well-founded semantics, which show that the regular model semantics is a natural extension of the latter two semantics.