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
Reducing disjunctive to non-disjunctive semantics by shift-operations
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Abduction from logic program: semantics and complexity
Theoretical Computer Science
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Preferred answer sets for extended logic programs
Artificial Intelligence
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Disjunctive logic programs with inheritance
Proceedings of the 1999 international conference on Logic programming
Answer set programming and plan generation
Artificial Intelligence
A Logical Basis for Object Oriented Programming
JELIA '90 Proceedings of the European Workshop on Logics in AI
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Query Answering in Information Systems with Integrity Constraints
Proceedings of the IFIP TC11 Working Group 11.5, First Working Conference on Integrity and Internal Control in Information Systems: Increasing the confidence in Information Systems
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
A comparative study of logic programs with preference
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
An introduction to fuzzy answer set programming
Annals of Mathematics and Artificial Intelligence
Characterizing efficiency without linear structure: a unified approach
Journal of Global Optimization
Decision supporting system based on fuzzy default reasoning
HSI'09 Proceedings of the 2nd conference on Human System Interactions
A preference-based framework for updating logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Using ASP for knowledge management with user authorization
Data & Knowledge Engineering
Solving satisfiability problems with preferences
Constraints
Weight constraints with preferences in ASP
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
An ordered logic program solver
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Efficient querying of inconsistent databases with binary integer programming
Proceedings of the VLDB Endowment
| 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, disjunction and some other formalisms such as logic programs with ordered disjunction. The approach is shown to be useful in several application areas, e.g. repairing database, where minimal repairs correspond to preferred answer sets.