Unification as a complexity measure for logic programming
- 30 June 1987
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 4 (2), 105-117
- https://doi.org/10.1016/0743-1066(87)90014-8
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Unification as a complexity measure for logic programmingThe Journal of Logic Programming, 1987
- Hard examples for resolutionJournal of the ACM, 1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Alternation and the computational complexity of logic programsThe Journal of Logic Programming, 1984
- Data structures for distributed countingJournal of Computer and System Sciences, 1984
- Logic for problem solvingACM SIGSOFT Software Engineering Notes, 1982
- Some results on relativized deterministic and nondeterministic time hierarchiesJournal of Computer and System Sciences, 1981
- The Art of Computer Programming, Vol. 3: Sorting and SearchingMathematics of Computation, 1974
- Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen AlternationenArchive for Mathematical Logic, 1974
- Grundzuge der Mathematischen Logik.The American Mathematical Monthly, 1963