Semantics for Possibilistic Disjunctive Programs
From MaRDI portal
Publication:2845121
DOI10.1017/S1471068411000408zbMath1272.68081MaRDI QIDQ2845121
Juan Carlos Nieves, Mauricio Osorio, Ulises Cortés
Publication date: 22 August 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Related Items (4)
Characterizing and extending answer set semantics using possibility theory ⋮ Syntax and semantics of multi-adjoint normal logic programming ⋮ Possibilistic nested logic programs and strong equivalence ⋮ The possibilistic Horn non-clausal knowledge bases
Cites Work
- Unnamed Item
- Possibilistic logic: a retrospective and prospective view
- Combining probabilistic logic programming with the power of maximum entropy
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- Possibilistic uncertainty handling for answer set programming
- Evidential support logic programming
- Probabilistic logic programming
- Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
- An introduction to fuzzy answer set programming
- A lattice-theoretical fixpoint theorem and its applications
- Probabilistic reasoning with answer sets
- Quantitative deduction and its fixpoint theory
- Bilattices and the semantics of logic programming
- Stable inference as intuitionistic validity
- Characterizations of the disjunctive stable semantics by partial evaluation
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants
- Semantics for Possibilistic Disjunctive Programs
- Temporal disjunctive logic programming
- A general theory of confluent rewriting systems for logic programming and its applications
This page was built for publication: Semantics for Possibilistic Disjunctive Programs
