Removing Redundancy from a Clause

[1]  Georg Gottlob.  On the Complexity of Clause Condensing , 1991, ÖGAI.

[2]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[4]  Letizia Tanca,et al.  What you Always Wanted to Know About Datalog (And Never Dared to Ask) , 1989, IEEE Trans. Knowl. Data Eng..

[5]  Juris Hartmanis.  New Developments in Structural Complexity Theory , 1990, Theor. Comput. Sci..

[6]  Manfred Schmidt-Schauß.  Implication of Clauses is Undecidable , 1988, Theor. Comput. Sci..

[7]  Klaus W. Wagner,et al.  Bounded query computations , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[8]  Jim Kadin.  The polynomial time hierarchy collapses if the Boolean hierarchy collapses , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[9]  Alexander Leitsch.  Implication Algorithms for Classes of Horn Clauses , 1988 .

[10]  Georg Gottlob,et al.  Subsumption and Implication , 1987, Inf. Process. Lett..

[11]  Paliath Narendran,et al.  NP-Completeness of the Set Unification and Matching Problems , 1986, CADE.

[12]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[13]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Georg Gottlob,et al.  Fast Subsumption Algorithms , 1985, European Conference on Computer Algebra.

[15]  Georg Gottlob,et al.  On the efficiency of subsumption algorithms , 1985, JACM.

[16]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[17]  Donald W Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[20]  William H. Joyner.  Automatic Theorem-Proving and the Decision Problem , 1973, SWAT.

[21]  Rona B. Stillman.  The Concept of Weak Substitution in Theorem-Proving , 1973, JACM.

[22]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.