On Computing Subfields
- 作者Jürgen Klüners; Michael Pohst
- 卷第24卷
- 印刷ISSN0747-7171
- 电子ISSN1095-855X
- 文件大小446.85KB
- 发表时间1997
- DOI10.1006/jsco.1996.0140
- 页码385-397
On Deciding Subsumption ProblemsUwe Egly; Reinhard Pichler; Stefan Woltran · Annals of Mathematics and Artificial Intelligence · 2005
On deciding subsumption problemsUwe Egly; Reinhard Pichler; Stefan Woltran · Annals of Mathematics and Artificial Intelligence · 2005
An answer to an open problem of UrquhartUwe Egly · 1998
On Different Intuitionistic Calculi and Embeddings fromInttoS4Uwe Egly · Studia Logica · 2001
Proof-complexity results for nonmonotonic reasoningEgly, Uwe; Tompits, Hans · ACM Transactions on Computational Logic · 2001
Complexity Classifications for Logic-Based ArgumentationCreignou, Nadia; Egly, Uwe; Schmidt, Johannes · ACM Transactions on Computational Logic · 2014
Intuitionistic Proof Transformations: Complexity and Applications: Extended AbstractUwe Egly; Stephan Schmitt · 1998
On Different Proof-Search Strategies for OrthologicUwe Egly; Hans Tompits · Studia Logica · 2003