On the relation between default and autoepistemic logic
Artificial Intelligence
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
On the Computational Complexity of Quantified Horn Clauses
CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
Loop formulas for circumscription
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Default logic, propositional logic and constraints
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction
Journal of Computer Science and Technology
| Hi-index | 0.00 |
In this paper, the notions of polynomial–time model equivalent reduction and polynomial–space model equivalent reduction are introduced in order to investigate in a subtle way the expressive power of different theories. We compare according to these notions some classes of propositional formulas and quantified Boolean formulas. Our results show that classes of theories with the same complexity might have different representation strength under some conjectures which are widely believed to be true in computation complexity theory.