The Complexity of Theorem Proving in Circumscription and Minimal Entailment
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Olaf Beyersdorff, Leroy Chew
The Complexity of Theorem Proving in Circumscription and Minimal Entailment
IJCAR, 2014.

IJCAR 2014
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{IJCAR-2014-BeyersdorffC,
	author        = "Olaf Beyersdorff and Leroy Chew",
	booktitle     = "{Proceedings of the Seventh International Joint Conference on Automated Reasoning}",
	doi           = "10.1007/978-3-319-08587-6_32",
	isbn          = "978-3-319-08586-9",
	pages         = "403--417",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{The Complexity of Theorem Proving in Circumscription and Minimal Entailment}",
	volume        = 8562,
	year          = 2014,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.