Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Publications
Complexity of propositional nested circumscription and nested abnormality theories
Complexity of propositional nested circumscription and nested abnormality theories
Marco Cadoli‚ Thomas Eiter and Georg Gottlob
Journal
ACM Trans. Comput. Log.
Number
2
Pages
232−272
Volume
6
Year
2005
Links
BibTeX
DOI
(10.1145/1055686.1055688)
See Also
Georg Gottlob
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top