Removing redundancy from a clause
- 1 June 1993
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 61 (2) , 263-289
- https://doi.org/10.1016/0004-3702(93)90069-n
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- New developments in structural complexity theoryTheoretical Computer Science, 1990
- What you always wanted to know about Datalog (and never dared to ask)IEEE Transactions on Knowledge and Data Engineering, 1989
- Implication of clauses is undecidableTheoretical Computer Science, 1988
- The complexity of facets resolvedJournal of Computer and System Sciences, 1988
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- Subsumption and implicationInformation Processing Letters, 1987
- On the efficiency of subsumption algorithmsJournal of the ACM, 1985
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- Resolution Strategies as Decision ProceduresJournal of the ACM, 1976
- The Concept of Weak Substitution in Theorem-ProvingJournal of the ACM, 1973