Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
Artificial Intelligence - Special issue on nonmonotonic reasoning
Inferring acceptable arguments with Answer Set Programming
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
Preferred answer sets for ordered logic programs
Theory and Practice of Logic Programming
Two alternatives for handling preferences in qualitative choice logic
Fuzzy Sets and Systems
Qualitative Constraint Enforcement in Advanced Policy Specification
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Support for context-aware monitoring in home healthcare
Journal of Ambient Intelligence and Smart Environments
Hierarchical decision making in multi-agent systems using answer set programming
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Cooperating answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Qualitative model of game theory
MDAI'05 Proceedings of the Second international conference on Modeling Decisions for Artificial Intelligence
| Hi-index | 0.00 |
Logic programs with ordered disjunction (LPODs) add a new connective to logic programming. This connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A 脳 B intuitively means: if possible A, but if A is not possible, then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. In this paper we show how LPODs can be implemented using answer set solvers for normal programs. The implementation is based on a generator which produces candidate answer sets and a tester which checks whether a given candidate is maximally preferred and produces a better candidate if it is not. We also discuss the complexity of reasoning tasks based on LPODs.