Alternation and the computational complexity of logic programs
Author:
- 1 June 1984
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 1 (1) , 19-33
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- 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
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980
- 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
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 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