Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (2008)

AUTHORS:

ABSTRACT:

The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz' parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed values while others are falsified. Prioritized circumscription further refines this setting in terms of priority classes for atoms being falsified. In this paper, we present a linear and faithful transformation to embed prioritized circumscription into disjunctive logic programming in a systematic fashion. The implementation of the method enables the use of disjunctive solvers for computing prioritized circumscription. The results of an experimental evaluation indicate that the method proposed herein compares favorably with other existing implementations.

URL:
http://dx.doi.org/10.1007/978-3-540-85776-1_15

@inproceedings{
    OJ08:aimsa_eoikarin,
    editor = "Dochev, Danail and Pistore, Marco and Traverso, Paolo",
    author = "Oikarinen, Emilia and Janhunen, Tomi",
    publisher = "Springer",
    optmonth = "September",
    responsibleperson = "Oikarinen, Emilia",
    title = "Implementing Prioritized Circumscription by Computing Disjunctive Stable Models",
    url = "http://dx.doi.org/10.1007/978-3-540-85776-1_15",
    series = "Lecture Notes in Artificial Intelligence",
    booktitle = "Artificial Intelligence: Methodology, Systems, and Applications, 13th International Conference, AIMSA 2008, Varna, Bulgaria, September 2008 Proceedings",
    optaddress = "Varna, Bulgaria",
    pages = "167--180",
    volume = "5223",
    flags = "MCM public",
    year = "2008",
    impactfactor = "D3",
    abstract = "The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz' parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed values while others are falsified. Prioritized circumscription further refines this setting in terms of priority classes for atoms being falsified. In this paper, we present a linear and faithful transformation to embed prioritized circumscription into disjunctive logic programming in a systematic fashion. The implementation of the method enables the use of disjunctive solvers for computing prioritized circumscription. The results of an experimental evaluation indicate that the method proposed herein compares favorably with other existing implementations."
}

AUTHORS:

ABSTRACT:

URL: http://dx.doi.org/10.1007/978-3-540-85776-1_15

URL:
http://dx.doi.org/10.1007/978-3-540-85776-1_15