Semantical considerations on nonmonotonic logic
Artificial Intelligence
Artificial Intelligence
Quantitative deduction and its fixpoint theory
Journal of Logic Programming
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Inferring negative information from disjunctive databases
Journal of Automated Reasoning
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
Paraconsistent logic programming
Theoretical Computer Science
A fixpoint semantics for disjunctive logic programs
Journal of Logic Programming
Logic programs with classical negation
Logic programming
Bilattices and the semantics of logic programming
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Generalized disjunctive well-founded semantics for logic programs: procedural semantics
Methodologies for intelligent systems, 5
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Probabilistic logic programming
Information and Computation
A logic for reasoning with inconsistency
Journal of Automated Reasoning
Semantics for disjunctive logic programs with explicit and default negation
Fundamenta Informaticae
Probabilistic logic programming with conditional constraints
ACM Transactions on Computational Logic (TOCL)
Fuzzy Logic Technology and Applications I
Fuzzy Logic Technology and Applications I
Procedural Semantics for Fuzzy Disjunctive Programs
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
WF³: A Semantics for Negation in Normal Disjunctive Logic Programs
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Bilattices and modal operators
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Quantitative Disjunctive Logic Programming: semantics and computation
AI Communications
Logic programs with uncertainties: a tool for implementing rule-based systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Procedural Semantics for Fuzzy Disjunctive Programs
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A top-k query answering procedure for fuzzy logic programming
Fuzzy Sets and Systems
| Hi-index | 0.00 |
In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L,≤,∪,∩,⇒, 0, 1). A graded strong literal disjunction is a pair (D, c) where D is a strong literal disjunction of the form l1 ∨ ... ∨ ln and c is a truth value from the lattice L. A graded disjunction can be understood as a means of the representation of incomplete and uncertain information, where the incompleteness is formalised by its strong literal disjunction, while the uncertainty by its truth degree. In the end, the coincidence of the procedural and fixpoint semantics, proposed in [18], will be reached.