A NEW METHOD OF PROVING THE EXISTENCE OF ANSWER SETS FOR DISJUNCTIVE LOGIC PROGRAMS: A METRIC FIXED POINT THEOREM FOR MULTI-VALUED MAPS
@inproceedings{Khamsi1993ANM, title={A NEW METHOD OF PROVING THE EXISTENCE OF ANSWER SETS FOR DISJUNCTIVE LOGIC PROGRAMS: A METRIC FIXED POINT THEOREM FOR MULTI-VALUED MAPS}, author={M. A. Khamsi and Vladik Kreinovich and Driss Misane}, year={1993} }
After the success of stable model semantics [GL88] and its generalization for programs with classical negations [GL90], the same ideas have been used in [GL91] to include disjunction into the resulting formalization of commonsense reasoning. The resulting semantics of disjunctive logic programs is relatively new, and therefore, few results are known. An additional problem with this semantics is as follows: since it incorporates a larger number of logical connectives, it is inevitably more… CONTINUE READING
Citations
Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS
Generalized Distance Functions in the Theory of Computation
VIEW 7 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED
Natural topology via fuzzy metric
VIEW 2 EXCERPTS
CITES BACKGROUND
On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
The Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming
VIEW 2 EXCERPTS
CITES METHODS
Multivalued Mappings, Fixed-Point Theorems and Disjunctive Databases
VIEW 3 EXCERPTS
CITES RESULTS & BACKGROUND
The Fixed-Point Theorems of Priess-Crampe and Ribenboimin Logic
VIEW 2 EXCERPTS
CITES METHODS
References
Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES
General topology
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL
Nonstandard Methods in Fixed Point Theory
VIEW 3 EXCERPTS
Foundations of Logic Programming
VIEW 1 EXCERPT