Alternation and the computational complexity of logic programs
- 1 June 1984
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 1 (1) , 19-33
- https://doi.org/10.1016/0743-1066(84)90021-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Metamorphosis grammarsPublished by Springer Nature ,2005
- Introduction to automata theory, languages, and computation, 2nd editionACM SIGACT News, 2001
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- Logic for problem solvingACM SIGSOFT Software Engineering Notes, 1982
- AlternationJournal of the ACM, 1981
- The prolog phenomenonACM SIGART Bulletin, 1980
- And/Or Programs: A New Approach to Structured ProgrammingACM Transactions on Programming Languages and Systems, 1980
- Algorithm = logic + controlCommunications of the ACM, 1979
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965