Dealing Automatically with Exceptions by Introducing Specificity in ASP

DOI10.1007/978-3-642-02906-6_53zbMath1245.68185OpenAlexW1509044221MaRDI QIDQ3638184

Stéphane Ngoma, Pascal Nicolas, Laurent Garcia

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_53

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (3)

Dealing with explicit preferences and uncertainty in answer set programming ⋮ Handling Exceptions in Logic Programming without Negation as Failure ⋮ Using possibilistic logic for modeling qualitative decision: answer set programming algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Possibilistic uncertainty handling for answer set programming
• The complexity of facets resolved
• A logic for default reasoning
• General logical databases and programs: Default logic semantics and stratification
• Nonmonotonic reasoning, preferential models and cumulative logics
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Compiling specificity into approaches to nonmonotonic reasoning
• Extending and implementing the stable model semantics
• On exact selection of minimally unsatisfiable subformulae
• Compiling defeasible inheritance networks to general logic programs
• Logic programming. 24th international conference, ICLP 2008, Udine, Italy, December 9--13 2008. Proceedings
• Handling uncertainty and defeasibility in a possibilistic logic setting
• Algorithms for computing minimal unsatisfiable subsets of constraints
• The DLV system for knowledge representation and reasoning
• Conflict-Driven Answer Set Enumeration

This page was built for publication: Dealing Automatically with Exceptions by Introducing Specificity in ASP