Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Results on translating defaults to circumscription
Artificial Intelligence
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
On the relationship between circumscription and negation as failure
Artificial Intelligence
A study of nonmonotonic reasoning
A study of nonmonotonic reasoning
A logic of knowledge and justified assumptions
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Expressive power and complexity of partial models for disjunctive deductive databases
Theoretical Computer Science
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
From answer set logic programming to circumscription via logic of GK
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
In this paper, it is shown that stable model semantics, perfect model semantics, and partial stable model semantics of disjunctive logic programs have the same expressive power with respect to the polynomial-time model-equivalent reduction. That is, taking perfect model semantics and stable model semantic as an example, any logic program P can be transformed in polynomial time to another logic program P′ such that perfect models (resp. stable models) of P 1-1 correspond to stable models (resp. perfect models) of P′, and the correspondence can be computed also in polynomial time. However, the minimal model semantics has weaker expressiveness than other mentioned semantics, otherwise, the polynomial hierarchy would collapse to NP.