Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Simply logical: intelligent reasoning by example
Simply logical: intelligent reasoning by example
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Answer set programming and plan generation
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Developing a Declarative Rule Language for Applications in Product Configuration
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Considerations on Updates of Logic Programs
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Preferred Answer Sets for Ordered Logic Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The DLVK Planning System: Progress Report
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Pushing Goal Derivation in DLP Computations
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Planning under Incomplete Knowledge
CL '00 Proceedings of the First International Conference on Computational Logic
Choice Logic Programs and Nash Equilibria in Strategic Games
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
Preferred answer sets for ordered logic programs
Theory and Practice of Logic Programming
The Diagnosis Frontend of the dlv system
AI Communications
Experimenting with heuristics for answer set programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Preferential reasoning on a web of trust
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Synthesis from temporal specifications using preferred answer set programming
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Hi-index | 0.00 |
We describe the design of the olps system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended answer sets of a simple program using an intuitive 9-valued lattice, called T9. During the computation, this lattice is employed to keep track of the status of the literals and the rules while evolving to a solution. It turns out that the basic algorithm needs little modification in order to be able to compute the preferred answer sets of an ordered logic program. We illustrate the system using an example from diagnostic reasoning and we present some preliminary benchmark results comparing olps with existing answer set solvers such as smodels and dlv.