Fast algorithms for testing unsatisfiability of ground horn clauses with equations
- 31 October 1987
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 4 (2) , 233-254
- https://doi.org/10.1016/s0747-7171(87)80067-6
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- Positive First-Order Logic Is NP-CompleteIBM Journal of Research and Development, 1981
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Reasoning About Recursively Defined Data StructuresJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975