Dealing with explicit preferences and uncertainty in answer set programming

DOI10.1007/s10472-012-9311-0zbMath1258.68139MaRDI 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 preferences; possibilistic answer set programming; uncertain nonmonotonic reasoning

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T30: Knowledge representation

68T37: Reasoning under uncertainty in the context of artificial intelligence

68N17: Logic programming

Related Items

Possibilistic nested logic programs and strong equivalence, Using possibilistic logic for modeling qualitative decision: answer set programming algorithms

Uses Software

• CP-nets

Cites Work

• 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 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item