Author:
Pearce David,Sarsakov Vladimir,Schaub Torsten,Tompits Hans,Woltran Stefan
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. M. Baaz, U. Egly, and A. Leitsch. Normal Form Transformations. In Handbook of Automated Reasoning, volume I, chapter 5, pages 273–333. Elsevier Science B. V., 2001.
2. M. Baaz and C. G. Fermüller. Resolution-based Theorem Proving for Many-valued Logics. Journal of Symbolic Computation, 19(4):353–391, 1995.
3. C. Baral and C. Uyan. Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming. In Proc. LPNMR-01, pages 186–199, 2001.
4. M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pages 262–267, 1998.
5. D. de Jongh and L. Hendriks. Characterization of Strongly Equivalent Logic Programs in Intermediate Logics. Technical report, 2001. Preprint at http://turing.wins.uva.nl/~lhendrik/ .
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献