CSL ...: ProceedingsSpringer-Verlag, 1987 - Computer science |
Contents
Diagonalizing over Deterministic Polynomial Time | 1 |
Resolution with Feature Unification | 17 |
Proving Finite Satisfiability of Deductive Databases | 44 |
Copyright | |
15 other sections not shown
Other editions - View all
Common terms and phrases
a₁ algebra algorithm applied arbitrary assignment atoms automata automaton axiom b₁ backtracking Boolean bounded calculus called characterization clauses closure co-NP complexity Computer Science consider consistent construct corresponding database defined definition denoted diagonalization dynamic elements equivalent example exists extended F₁ feature terms finite satisfiability formulas functions goal graph groupoid h-core model Hence Herbrand homomorphism Horn clauses implies induction infinite input iteration labels Lemma Logic Programming loop Modula natural numbers node nondeterministic normal form NP-complete NTIMEF(Pol obtain operational semantics operator optimization partial path path-fair polynomial predicate logic problem Proc procedure programming language Prolog Prolog programs proof system propositional propositional calculus prove quadratic quadratic functions recursive recursive sets result rewrite semantics semigroupoid sequence string subset subterm subtree T-model t₁ Theorem theory transformations transition rule transitive closure type inference unsatisfiable update