Hierarchic reasoning in local theory extensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3632 LNAI, Issue , 2005, Pages 219-234

  Sofronie Stokkermans, Viorica ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; FUNCTIONS;

BASE THEORY; HIERARCHIC REASONING;

HIERARCHICAL SYSTEMS;

EID: 26944460408     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_16     Document Type: Conference Paper

References (11)

1. P. Burmeister. A Model Theoretic Oriented Approach to Partial Algebras: Introduction to Theory and Application of Partial Algebras, Part I, volume 31 of Mathematical Research. Akademie-Verlag, Berlin, 1986.
2. S. Burris. Polynomial time uniform word problems. Mathematical Logic Quarterly, 41:173-182, 1995.
3. A. Dolzmann and T. Sturm. Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2-9, 1997.
4. H. Ganzinger. Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems. In Proc. 16th IEEE Symposium on Logic in Computer Science (LICS'01), pages 81-92. IEEE Computer Society Press, 2001.
5. H. Ganzinger. Shostak light. In A. Voronkov, editor, Automated Deduction CADE-18, LNCS 2392, pages 332-346, Copenhagen, Denmark, 2002. Springer.
6. H. Ganzinger, V. Sofronie-Stokkermans, and U. Waldmann. Modular proof systems for partial functions with weak equality. In Proc. International Joint Conference on Automated Reasoning (IJCAR'04), LNCS 3097, pages 168-182. Springer, 2004.
7. R. Givan and D. McAllester. New results on local inference relations. In Principles of Knowledge Representation and reasoning: Proceedings of the Third International Conference (KR'92), pages 403-412. Morgan Kaufmann Press, 1992.
8. D. McAllester. Automatic recognition of tractability in inference relations. Journal of the Association for Computing Machinery, 40(2):284-303, 1993.
9. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 39th Design Automation Conference (DAC 2001), pages 530-535. ACM, 2001.
10. C. Tinelli and G.G. Zarba. Combining non-stably infinite theories. Journal of Automated Reasoning, 2005. to appear.
11. Ch. Weidenbach, B. Gaede, and G. Rock. SPASS & FLOTTER Version 0.42. In M.A. McRobie and J.K. Slaney, editors, Proceedings of CADE-13, LNCS 1104, pages 141-145. Springer Verlag, 1996.