Dealing Automatically with Exceptions by Introducing Specificity in ASP

Authors:
Laurent Garcia;Stéphane Ngoma;Pascal Nicolas
Affiliations:
LERIA, UFR Sciences, University of Angers, ANGERS cedex 01, F-49045;LERIA, UFR Sciences, University of Angers, ANGERS cedex 01, F-49045;LERIA, UFR Sciences, University of Angers, ANGERS cedex 01, F-49045
Venue:
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2009

Citing 17
Cited 3

The complexity of facets resolved

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
General logical databases and programs: default logic semantics and stratification

Information and Computation
On the complexity of propositional knowledge base revision, updates, and counterfactuals

Artificial Intelligence
Compiling specificity into approaches to nonmonotonic reasoning

Artificial Intelligence
Compiling defeasible inheritance networks to general logic programs

Artificial Intelligence
Extending and implementing the stable model semantics

Artificial Intelligence
Compiling Default Theory int Extended Logic Programming

IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
System Z: A Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning

Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
On Exact Selection of Minimally Unsatisfiable Subformulae

Annals of Mathematics and Artificial Intelligence
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Possibilistic uncertainty handling for answer set programming

Annals of Mathematics and Artificial Intelligence
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

Journal of Automated Reasoning
Handling uncertainty and defeasibility in a possibilistic logic setting

International Journal of Approximate Reasoning
Learning extended logic programs

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Conflict-driven answer set solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Boosting a complete technique to find MSS and MUS thanks to a local search oracle

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Handling exceptions in logic programming without negation as failure

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Dealing with explicit preferences and uncertainty in answer set programming

Annals of Mathematics and Artificial Intelligence
Using possibilistic logic for modeling qualitative decision: Answer Set Programming algorithms

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Answer Set Programming (ASP), via normal logic programs, is known as a suitable framework for default reasoning since it offers both a valid formal model and operational systems. However, in front of a real world knowledge representation problem, it is not easy to represent information in this framework. That is why the present article proposed to deal with this issue by generating in an automatic way the suitable normal logic program from a compact representation of the information. This is done by using a method, based on specificity, that has been developed for default logic and which is adapted here to ASP both in theoretical and practical points of view.