A decomposition rule for decision procedures by resolution-based calculi

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

Volumn 3452 LNAI, Issue , 2005, Pages 21-35

  Hustadt, Ullrich ^a   Motik, Boris ^b   Sattler, Ulrike ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b UNIVERSITY OF KARLSRUHE   (Germany)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DECISION MAKING; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; OPTIMIZATION; THEOREM PROVING;

COMPLEX LOGICS; DECOMPOSITION RULES; INFERENCE RULES; RESOLUTION-BASED CALCULI;

FORMAL LOGIC;

EID: 26844455348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_2     Document Type: Conference Paper

References (21)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. L. Bachmair and H. Ganzinger. Resolution Theorem Proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, pages 19-99. Elsevier Science, 2001.
3. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation, 121(2):172-192, 1995.
4. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the Decidability of Query Containment under Constraints. In Proc. PODS 1998, pages 149-158. ACM Press, 1998.
5. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. STOC 1977, pages 77-90. ACM Press, 1977.
6. H. de Nivelle. Splitting through new proposition symbols. In Proc. LPAR 2001, volume 2250 of LNAI, pages 172-185. Springer, 2001.
7. N. Dershowitz and D.A. Plaisted. Rewriting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, pages 535-610. Elsevier Science, 2001.
8. C. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet, Resolution Decision Procedures. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, pages 1791-1849. Elsevier Science, 2001.
9. I. Horrocks, U. Sattler, and S. Tobies. Practical Reasoning for Very Expressive Description Logics. Logic Journal of the IGPL, 8(3):239-263, 2000.
10. U. Hustadt, B. Motik, and U. Sattler. Reasoning for Description Logics around SHIQ in a Resolution Framework. Technical Report 3-8-04/04, FZI, Germany, 2004. http://www.fzi.de/wim/publikationen.php?id=1172.
11. - Description Logic to Disjunctive Datalog Programs. In Proc. KR 2004, pages 152-162. AAAI Press, 2004.
12. W. H. Joyner Jr. Resolution Strategies as Decision Procedures. J. ACM, 23(3):398-417, 1976.
13. C. Lutz and U. Sattler. The Complexity of Reasoning with Boolean Modal Logics. In Advances in Modal Logics, volume 3. CSLI Publications, Stanford, 2001.
14. R. Nieuwenhuis and A. Rubio. Theorem Proving with Ordering and Equality Constrained Clauses. J. Logic and Computation, 19(4):312-351, 1995.
15. R. Nieuwenhuis and A. Rubio. Paramodulation-Based Theorem Proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, pages 371-443. Elsevier Science, 2001.
16. D. A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Transformation. J. Symbolic Logic and Computation, 2(3):293-304, 1986.
17. A. Riazanov and A. Voronkov. Splitting Without Backtracking. In Proc. IJCAI 2001, pages 611-617. Morgan Kaufmann, 2001.
18. R. A. Schmidt and U. Hustadt. A Resolution Decision Procedure for Fluted Logic. In D. McAllester, editor, Proc. CADE 2000, pages 433-448. Springer, 2000.
19. S. Tessaris. Questions and answers: reasoning and querying in Description Logic. PhD thesis, University of Manchester, UK, 2001.
20. S. Tobies. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen, Germany, 2001.
21. C. Weidenbach. Combining Superposition, Sorts and Splitting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, pages 1965-2013. Elsevier Science, 2001.