A theory of diagnosis from first principles
Artificial Intelligence
Logic programs with exceptions
Logic programming
Complexity results for disjunctive logic programming and application to nonmonotonic logics
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Abduction from logic program: semantics and complexity
Theoretical Computer Science
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Answer set programming and plan generation
Artificial Intelligence
Computing consistent query answers using conflict hypergraphs
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Minimal-change integrity maintenance using tuple deletions
Information and Computation
A knowledge-based approach for selecting information sources
Theory and Practice of Logic Programming
A framework for prioritized reasoning based on the choice evaluation
Proceedings of the 2007 ACM symposium on Applied computing
Approximating Extended Answer Sets
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
On the semantics of logic programs with preferences
Journal of Artificial Intelligence Research
Consistent query answers in the presence of universal constraints
Information Systems
Minimal-change integrity maintenance using tuple deletions
Information and Computation
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
ASTREA: answer sets for a trusted reasoning environment for agents
Logic programming, knowledge representation, and nonmonotonic reasoning
Preferential reasoning on a web of trust
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
On the semantics of logic programs with preferences
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Synthesis from temporal specifications using preferred answer set programming
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
An ordered logic program solver
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Preference-driven querying of inconsistent relational databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a "best" answer set. Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a preference for satisfying certain rules, possibly at the cost of violating less important ones. We show that such a rule order induces a natural order on extended answer sets, the minimal elements of which we call preferred answer sets. We characterize the expressiveness of the resulting semantics and show that it can simulate negation as failure as well as disjunction. We illustrate an application of the approach by considering database repairs, where minimal repairs are shown to correspond to preferred answer sets.