Semantics For Disjunctive Logic Programs With Explicit And Default Negation

Authors:
Jack Minker;Carolina Ruiz
Affiliations:
Department of Computer Science, Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, U.S.A.;Department of Computer Science, Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, U.S.A.
Venue:
Fundamenta Informaticae
Year:
1994

Citing 30
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Inferring negative information from disjunctive databases

Journal of Automated Reasoning
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 deductive databases and logic programs

Foundations of deductive databases and logic programming
Weak generalized closed world assumption

Journal of Automated Reasoning
On the declarative and procedual semantics of logic programs

Journal of Automated Reasoning
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
A fixpoint semantics for disjunctive logic programs

Journal of Logic Programming
Extended stable semantics for normal and disjunctive programs

Logic programming
Logic programs with classical negation

Logic programming
Generalized well-founded semantics for logic programs

CADE-10 Proceedings of the tenth international conference on Automated deduction
Logic programming with strong negation

Proceedings of the international workshop on Extensions of logic programming
A database needs two kinds of negation

MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
Autoepistemic logic

Journal of the ACM (JACM)
Generalized disjunctive well-founded semantics for logic programs: procedural semantics

Methodologies for intelligent systems, 5
Stationary semantics for disjunctive logic programs and deductive databases

Proceedings of the 1990 North American conference on Logic programming
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
Issues in knowledge representation: semantics and knowledge combination

Issues in knowledge representation: semantics and knowledge combination
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)
WF³: A Semantics for Negation in Normal Disjunctive Logic Programs

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
On Extended Disjunctive Logic Programs

ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction
Embedding Negation as Failure into a Model Generation Theorem Prover

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Procedural Interpretation of Non-Horn Logic Programs

Proceedings of the 9th International Conference on Automated Deduction
An Alternative Characterization of Disjunctive Logic Programs

An Alternative Characterization of Disjunctive Logic Programs
Semantics for normal disjunctive logic programs

Semantics for normal disjunctive logic programs
On stratified autoepistemic theories

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, fixpoint, and proof theoretic characterizations of an arbitrary semantics of normal disjunctive logic programs to cover the class of extended programs. Illustrations of these techniques are given for stable models, disjunctive well-founded and stationary semantics. The declarative complexity of the extended programs, as well as the algorithmic complexity of the proof procedures and fixpoint operators, are discussed.