Possibilistic uncertainty handling for answer set programming

DOI10.1007/S10472-006-9029-YzbMath1105.68104OpenAlexW2040340501MaRDI QIDQ854974

Claire Lefèvre, Igor Stéphan, Laurent Garcia, Pascal Nicolas

Publication date: 20 December 2006

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-006-9029-y

zbMATH Keywords

uncertaintypossibility theorynonmonotonic reasoninglogic programminganswer set programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Related Items (17)

Handling uncertainty and defeasibility in a possibilistic logic setting ⋮ Dealing with explicit preferences and uncertainty in answer set programming ⋮ Characterizing and extending answer set semantics using possibility theory ⋮ A core language for fuzzy answer set programming ⋮ An introduction to fuzzy answer set programming ⋮ Reducing fuzzy answer set programming to model finding in fuzzy logics ⋮ Answer Set Programming for Computing Decisions Under Uncertainty ⋮ Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study ⋮ The PITA system: Tabling and answer subsumption for reasoning under uncertainty ⋮ Dealing Automatically with Exceptions by Introducing Specificity in ASP ⋮ Aggregated fuzzy answer set programming ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Possibilistic nested logic programs and strong equivalence ⋮ The possibilistic Horn non-clausal knowledge bases ⋮ Fuzzy autoepistemic logic and its relation to fuzzy answer set programming ⋮ Using possibilistic logic for modeling qualitative decision: answer set programming algorithms ⋮ Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

Uses Software

• Cmodels
• Smodels

Cites Work

• Annotated nonmonotonic rule systems
• Graded hypothesis theories
• A logic for default reasoning
• General logical databases and programs: Default logic semantics and stratification
• Nonmonotonic reasoning, preferential models and cumulative logics
• Fuzzy sets as a basis for a theory of possibility
• Preferred answer sets for extended logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Possibility theory, probability theory and multiple-valued logics: a clarification
• Weak nonmonotonic probabilistic logics
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Autoepistemic logic
• Logic programming and knowledge representation
• Logic Programming
• The DLV system for knowledge representation and reasoning
• Hierarchical constraint logic programming
• The nomore + + Approach to Answer Set Solving
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Logic Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Possibilistic uncertainty handling for answer set programming