Dealing with explicit preferences and uncertainty in answer set programming

DOI10.1007/s10472-012-9311-0zbMath1258.68139OpenAlexW2001716794MaRDI QIDQ1928820

Juan Carlos Nieves, Roberto Confalonieri, Javier Vázquez-Salceda, Mauricio Osorio

Publication date: 4 January 2013

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

Full work available at URL: https://doi.org/10.1007/s10472-012-9311-0

zbMATH Keywords

explicit preferencespossibilistic answer set programminguncertain nonmonotonic reasoning

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 (3)

Possibilistic nested logic programs and strong equivalence ⋮ The possibilistic Horn non-clausal knowledge bases ⋮ Using possibilistic logic for modeling qualitative decision: answer set programming algorithms

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Possibilistic uncertainty handling for answer set programming
• Handling uncertainty and defeasibility in a possibilistic logic setting
• Weak nonmonotonic probabilistic logics
• On theories with a combinatorial definition of 'equivalence'
• A lattice-theoretical fixpoint theorem and its applications
• COMMUNICATING ANSWER SET PROGRAMS
• Communicating ASP and the Polynomial Hierarchy
• Weight Constraints with Preferences in ASP
• Answer Set Programming for Computing Decisions Under Uncertainty
• Handling Exceptions in Logic Programming without Negation as Failure
• Working with Preferences: Less Is More
• Probabilistic reasoning with answer sets
• Modeling preferences and conditional preferences on resource consumption and production in ASP
• Dealing Automatically with Exceptions by Introducing Specificity in ASP
• Logic programming and knowledge representation
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Transformation-based bottom-up computation of the well-founded model
• Semantics of (disjunctive) logic programs based on partial evaluation
• Logic Programming
• Strongly equivalent logic programs
• Logic and structure.
• A general theory of confluent rewriting systems for logic programming and its applications
• Towards a possibilistic logic handling of preferences

This page was built for publication: Dealing with explicit preferences and uncertainty in answer set programming