Search
Feedback
About
Help
News
| Listing 1 - 2 of 2 |
Sort by
|
ISBN: 1139886363 1107366631 1107371325 1107361729 1107368456 1299404391 1107364175 0511526636 9781107361720 9780511526633 0521408261 9780521408264 Year: 1992 Volume: 169 Publisher: Cambridge : Cambridge University Press,
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.
Algebra, Boolean. --- Computational complexity --- Boolean algebra --- Boole's algebra --- Algebraic logic --- Set theory --- Algebra, Boolean --- Computational complexity - Congresses --- Algebra, Boolean - Congresses
ISBN: 354055873X 038755873X 3540473025 Year: 1992 Volume: vol 632 Publisher: Berlin : Springer-Verlag,
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
This volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebraic techniques and logic programming. On the one hand, logic programming has been very successful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory, and modularity are particularly well handled in an algebraic framework. Common foundations of both approaches have recently been developed, and this conference is a forum for people from both areas to exchange ideas, results, and experiences. The book covers the following topics: semantics ofalgebraic and logic programming; integration of functional and logic programming; term rewriting, narrowing, and resolution; constraintlogic programming and theorem proving; concurrent features in algebraic and logic programming languages; and implementation issues.
Programming --- Algebraic logic --- -Logic programming --- -681.3*D3 --- 681.3*F3 --- 681.3*F4 --- Computer programming --- Logic, Symbolic and mathematical --- Congresses --- Programming languages --- Logics and meanings of programs (Theory of computation) --- Mathematical logic and formal languages (Theory of computation) --- 681.3*F4 Mathematical logic and formal languages (Theory of computation) --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*D3 Programming languages --- Logic programming --- 681.3*D3 --- Information theory. --- Software engineering. --- Computer science. --- Logic design. --- Theory of Computation. --- Software Engineering/Programming and Operating Systems. --- Programming Languages, Compilers, Interpreters. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Informatics --- Science --- Computer software engineering --- Engineering --- Communication theory --- Communication --- Cybernetics
| Listing 1 - 2 of 2 |
Sort by
|