Fixed point theorems in logic programming

Authors:
Mohamed A. Khamsi;Driss Misane
Affiliations:
Department of Mathematical Sciences, University of Texas at El Paso, El Paso, TX 79968, USAE-mail: mohamed@math.utep.edu;Departement de Mathematiques, Universite Mohamed V, Faculte des Sciences, Rabat, Morocco
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
1997

Citing 4
Cited 8

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

Foundations of logic programming; (2nd extended ed.)
Signed data dependencies in logic programs

Journal of Logic Programming
Stable and extension class theory for logic programs and default logics

Journal of Automated Reasoning
Signed logic programs

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming

Fuzzy logic programming via multilattices

Fuzzy Sets and Systems
A Fixed-Point Theorem for Multi-valued Functions with an Application to Multilattice-Based Logic Programming

WILF '07 Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Reasoning Web
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Annals of Mathematics and Artificial Intelligence
On reachability of minimal models of multilattice-based logic programs

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Rules and logic programming for the web

RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Multi-lattices as a basis for generalized fuzzy logic programming

WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
A top-k query answering procedure for fuzzy logic programming

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss two major fixed point theorems which are based on a notion of completeness. Although the spaces involved are of different nature, there is a similarity between the two theorems.