Complexity results for the default- and autoepistemic logic
E. Steffen, in: E. Börger (Ed.), Computer Science Logic , Springer Berlin Heidelberg, 1992, pp. 339–352.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Editor
Börger, E.
Publishing Year
Proceedings Title
Computer Science Logic
Volume
626
Page
339 - 352
LibreCat-ID
Cite this
Steffen E. Complexity results for the default- and autoepistemic logic. In: Börger E, ed. Computer Science Logic . Vol 626. Springer Berlin Heidelberg; 1992:339-352.
Steffen, E. (1992). Complexity results for the default- and autoepistemic logic. In E. Börger (Ed.), Computer Science Logic (Vol. 626, pp. 339–352). Springer Berlin Heidelberg.
@inproceedings{Steffen_1992, title={Complexity results for the default- and autoepistemic logic}, volume={626}, booktitle={Computer Science Logic }, publisher={Springer Berlin Heidelberg}, author={Steffen, Eckhard}, editor={Börger, E.Editor}, year={1992}, pages={339–352} }
Steffen, Eckhard. “Complexity Results for the Default- and Autoepistemic Logic.” In Computer Science Logic , edited by E. Börger, 626:339–52. Springer Berlin Heidelberg, 1992.
E. Steffen, “Complexity results for the default- and autoepistemic logic,” in Computer Science Logic , 1992, vol. 626, pp. 339–352.
Steffen, Eckhard. “Complexity Results for the Default- and Autoepistemic Logic.” Computer Science Logic , edited by E. Börger, vol. 626, Springer Berlin Heidelberg, 1992, pp. 339–52.
Google Scholar