## Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India, December 17-19, 1987. ProceedingsThis volume gives the proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science. These conferences are organized and run by the computer science research community in India, and their purpose is to provide a forum for professional interaction between members of this research community and their counterparts in different parts of the world. The volume includes four invited papers on: - reasoning about linear constraints using parametric queries, - the parallel evaluation of classes of circuits, - a theory of commonsense visual reasoning, - natural language processing, complexity theory and logic. The 26 submitted papers are organized into sections on logic, automata and formal languages, theory of programming, parallel algorithms, geometric algorithms, concurrency, distributed computing, and semantics. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

abstract ACPV algorithm alternating automaton assume automata automaton axioms bisimulation bound clause colour compiler complete component computation tree Computer Science concurrent consider construction corresponding cycle database defined definition delete denote derived edge equations equivalent event ek example execution exists Figure finite function given goal graph G Hence homeomorphism implementation implies induction inequations inference rules input isomorphic label lambda abstraction language Lemma Logic Programming machine MC algorithm node NP-complete operation operational semantics optimal outerplanar graphs packets parallel partial term path pattern matching perfect graphs permutation graphs phase planar graphs polynomial PQCC predicate problem Proc procedure processors Prolog proof prove query graph R-points read-only transactions rectangles recursive result satisfies semantics semijoin program sequence sequential serializable sorting network specification step strategy subgraph Theorem topology transformation transition unambiguous variable vertex vertices