On the complexity of H-subsumption

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

Volumn 1584, Issue , 1999, Pages 355-371

  Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

REDUNDANCY;

AUTOMATED MODELING; AUTOMATED THEOREM PROVING; INFERENCE SYSTEMS; INHERENT COMPLEXITY; PARAMODULATION; POLYNOMIAL HIERARCHIES; REDUNDANCY ELIMINATION; REFUTATIONAL COMPLETENESS;

COMPUTER CIRCUITS;

EID: 10344266592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_24     Document Type: Conference Paper

References (14)

1. L.Bachmair, H.Ganzinger: Rewrite-based Equational Theorem Proving with Selection and Simplification, Journal of Logic and Computation, Vol 4 No 3, pp. 217-247 (1994). 357
2. F.Baader, J.H.Siekmann: Unification Theory, in Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press (1994). 367
3. H. Comon, P. Lescanne: Equational Problems and Disunification, Journal of Symbolic Computation, Vol 7, pp. 371-425 (1989). 368, 368
4. R.Caferra, N.Peltier: Decision Procedures using Model Building Techniques, Proceedings of CSL'95, LNCS 1092, pp.130-144, Springer (1996). 355, 355, 356, 356, 368
5. R.Caferra, N.Zabel: Extending Resolution for Model Construction, Proceedings of JELIA '90, LNAI 478, pp. 153-169, Springer (1991). 355, 355, 356, 356
6. C.Fermuller, A.Leitsch: Hyperresolution and Automated Model Building, Journal of Logic and Computation, Vol 6 No 2, pp.173-230 (1996). 355, 355, 355, 356, 356, 363, 363, 368, 368, 368, 369
7. M.R.Garey, D.S.Johnson: Computers and Intractability, A guide to the Theory of NP-Completeness, W.H. Freeman and Company (1979). 355, 360
8. J.Hsiang, M. Rusinowitch: Proving Refutational Completeness of Theorem- Proving Strategies: The Transfinite Semantic Tree Method, Journal of the ACM, Vol 38 No 3, pp. 559 - 587 (1991). 357, 358, 358
9. R.Kowalski, P.J.Hayes: Semantic Trees in Automated Theorem Proving, in Machine Intelligence 4, pp. 87-101 (1969). 357, 357, 358
10. A.Leitsch: The Resolution Calculus, Springer (Texts in Theoretical Computer Science), Berlin Heidelberg New York (1997). 357
11. R.Nieuwenhuis, A.Rubio: Theorem Proving with ordering and equality constrained clauses, Journal of Symbolic Computation, Vol 11, pp. 1-32 (1995). 357
12. R.Pichler: Algorithms on Atomic Representations of Herbrand Models, in Proceedings of JELIA '98, LNAI 1489, pp. 199-215, Springer (1998). 363, 363, 363, 363, 365, 365, 365, 366, 366, 366, 367, 368, 370, 370, 371
13. R. Pichler: Completeness and Redundancy in Constrained Clause Logic, in Proceedings of FTP'98 (Int. Workshop on First-Order Theorem Proving), Technical Report E1852-GS-981 of Technische Universitat Wien, pp. 193-203, available from http://www.logic.at/ftp98, Vienna (1998). 357, 357
14. L.J. Stockmeyer: The Polynomial Time Hierarchy, in Journal of Theoretical Computer Science, Vol 3, pp.1-12 (1976). 359, 359