CSL '87: 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings - Brossura
Sinossi
Diagonalizing over deterministic polynomial time.- Resolution with feature unification.- Surjectivity for finite sets of combinators by weak reduction.- Proving finite satisfiability of deductive databases.- Is setl a suitable language for parallel programming - a theoretical approach.- Loose diagrams, semigroupoids, categories, groupoids and iteration.- Algebraic operational semantics and modula-2.- Program verification using dynamic logic.- Induction in the elementary theory of types and names.- On the computational complexity of quantified Horn clauses.- The conjunctive complexity of quadratic boolean functions.- On type inference for object-oriented programming languages.- Optimization aspects of logical formulas.- Logic of approximation reasoning.- Deciding the path- and word-fair equivalence problem.- Learning by teams from examples with errors.- A survey of rewrite systems.- Interfacing a logic machine.- Complexity cores and hard-to-prove formulas.- On the average case complexity of backtracking for the exact-satisfiability problem.- On functions computable in nondeterministic polynomial time: Some characterizations.- Developing logic programs: Computing through normalizing.- Model theory of deductive databases.- Algorithms for propositional updates.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
