Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
From MaRDI portal
Publication:2353984
DOI10.1016/j.ijar.2013.09.006zbMath1316.68036OpenAlexW2114830586MaRDI QIDQ2353984
Kim Bauters, Dirk Vermeir, Martine De Cock, Steven Schockaert
Publication date: 10 July 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2013.09.006
Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Related Items (4)
Fuzzy Autoepistemic Logic: Reflecting about Knowledge of Truth Degrees ⋮ Revising Possibilistic Knowledge Bases via Compatibility Degrees ⋮ Possibilistic nested logic programs and strong equivalence ⋮ The possibilistic Horn non-clausal knowledge bases
Uses Software
Cites Work
- A core language for fuzzy answer set programming
- Conformant planning via symbolic model checking and heuristic search
- Possibilistic uncertainty handling for answer set programming
- Probabilistic logic
- Abduction from logic programs: Semantics and complexity
- Probabilistic default reasoning with conditional constraints
- Fuzzy relation equations and causal reasoning
- Conformant planning via heuristic forward search: A new approach
- Markov logic networks
- Fuzzy Equilibrium Logic
- Logics with Common Weak Completions
- Fuzzy Answer Set Programming
- Probabilistic reasoning with answer sets
- Knowledge Representation, Reasoning and Declarative Problem Solving
- A logic programming approach to knowledge-state planning
- The DLV system for knowledge representation and reasoning
- Semantics for Possibilistic Disjunctive Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
