Non-elementary speed-ups in default reasoning-Reference-Cited by-同舟云学术

Non-elementary speed-ups in default reasoning

Published:1997 Issue: Volume: Page:237-251
ISSN:0302-9743
Container-title:Qualitative and Quantitative Practical Reasoning
language:
Short-container-title:

Author:

Egly Uwe,Tompits Hans

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0035626

Reference17 articles.

1. M. Baaz and A. Leitsch. On Skolemization and Proof Complexity. Fundamenta Informaticae, 20:353–379, 1994.

2. P. A. Bonatti. A Gentzen System for Non-Theorems. Technical Report CD-TR 93/52, Christian Doppler Labor für Expertensysteme, Technische Universität Wien, Paniglgasse 16, A-1040 Wien, 1993.

3. P. A. Bonatti. Sequent Calculi for Default and Autoepistemic Logics. In Proceedings TABLEAUX'96, Springer LNCS 1071, pp. 127–142, 1996.

4. M. Cadoli, F. M. Donini, and M. Schaerf. Is Intractability of Non-Monotonic Reasoning a Real Drawback? In Proceedings of the AAAI National Conference on Artificial Intelligence, pp. 946–951. MIT Press, 1994.

5. M. Cadoli, F. M. Donini, and M. Schaerf. On Compact Representation of Propositional Circumscription. In Proceedings STACS '95, Springer LNCS 900, pp. 205–216, 1995.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proof-complexity results for nonmonotonic reasoning;ACM Transactions on Computational Logic;2001-07

2. On Proof Complexity of Circumscription;Lecture Notes in Computer Science;1998

3. A sequent calculus for circumscription;Computer Science Logic;1997

4. Is non-monotonic reasoning always harder;Logic Programming And Nonmonotonic Reasoning;1997