Handbook of theoretical computer science (vol. B)
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Ordering default theories and nonmonotonic logic programs
Theoretical Computer Science
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Generality relations in answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Rule Calculus: Semantics, Axioms and Applications
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On the resolution-based family of abstract argumentation semantics and its grounded instance
Artificial Intelligence
Exploring relations between answer set programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Hi-index | 0.00 |
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordination in multi-agent systems. We study generality relations in disjunctive default logic by comparing the amounts of information brought by default theories. Intuitively, a default theory is considered more general than another default theory if the former brings more information than the latter. Using techniques in domain theory, we introduce different types of generality relations over default theories. We show that generality relations based on the Smyth and Hoare orderings reflect orderings on skeptical and credulous consequences, respectively, and that two default theories are equivalent if and only if they are equally general under these orderings. These results naturally extend both generality relations over first-order theories and those for answer set programming.