Listing 1 - 10 of 11 | << page >> |
Sort by
|
Choose an application
Mathematical logic --- Ergodic theory. Information theory --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- algebra --- coderen --- informatica --- programmeren (informatica) --- wiskunde --- logica --- informatietheorie
Choose an application
Choose an application
681.3*F11 --- 681.3*F13 --- 681.3*F41 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic --- Decidability (Mathematical logic) --- Health Sciences --- Life Sciences --- Immunology --- Pathology --- Computable functions --- Gödel's theorem --- Logic, Symbolic and mathematical --- Recursive functions
Choose an application
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems. For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games. The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.
Computer science --- Machine theory. --- Logic, Symbolic and mathematical. --- Game theory. --- Logique symbolique et mathématique --- Théorie des jeux --- Mathematics. --- Machine theory --- Logic, Symbolic and mathematical --- Game theory --- Mathematics --- Computer Science --- Engineering & Applied Sciences --- Logique symbolique et mathématique --- Théorie des jeux --- Games, Theory of --- Theory of games --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Computer science. --- Computers. --- Computer Science. --- Theory of Computation. --- Computer Science, general. --- Mathematical models --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Algorithms --- Recursive functions --- Robotics --- Information theory. --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Calculators --- Cyberspace --- Informatique --- Logique mathématique --- Logique mathématique --- Computer science - Mathematics --- Automates abstraits
Choose an application
Computational complexity. --- Constraint databases. --- Finite model theory. --- Computer science --- Computational complexity --- Constraint databases --- Finite model theory --- 681.3*F13 --- 681.3*F41 --- 681.3*H23 --- 681.3*I24 --- 681.3*I28 --- 681.3*I24 Knowledge representation formalisms and methods: frames and scripts; predicate logic; relation systems; representation languages; procedural and rule-based representations; semantic networks (Artificial intelligence) --- Knowledge representation formalisms and methods: frames and scripts; predicate logic; relation systems; representation languages; procedural and rule-based representations; semantic networks (Artificial intelligence) --- 681.3*H23 Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- Model theory --- Databases --- Complexity, Computational --- Electronic data processing --- Machine theory --- 681.3*I28 Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematics --- Informatique
Choose an application
The annual conference of the European Association for Computer Science Logic (EACSL), CSL 2009, was held in Coimbra (Portugal), September 7-11, 2009. The conference series started as a programme of International Workshops on Computer Science Logic, and then at its sixth meeting became the Annual C- ference of the EACSL. This conference was the 23rd meeting and 18th EACSL conference; it was organized at the Department of Mathematics, Faculty of S- ence and Technology, University of Coimbra. In response to the call for papers, a total of 122 abstracts were submitted to CSL 2009of which 89 werefollowedby a full paper. The ProgrammeCommittee selected 34 papers for presentation at the conference and publication in these proceedings. The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. The awardrecipient for 2009 was Jakob Nordstr¨ om. Citation of the award, abstract of the thesis, and a biographical sketch of the recipient may be found at the end of the proceedings. The award was sponsored for the years 2007-2009 by Logitech S.A.
Mathematical logic --- Ergodic theory. Information theory --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- algebra --- coderen --- informatica --- programmeren (informatica) --- wiskunde --- logica --- informatietheorie
Choose an application
The annual conference of the European Association for Computer Science Logic (EACSL), CSL 2009, was held in Coimbra (Portugal), September 7–11, 2009. The conference series started as a programme of International Workshops on Computer Science Logic, and then at its sixth meeting became the Annual C- ference of the EACSL. This conference was the 23rd meeting and 18th EACSL conference; it was organized at the Department of Mathematics, Faculty of S- ence and Technology, University of Coimbra. In response to the call for papers, a total of 122 abstracts were submitted to CSL 2009of which 89 werefollowedby a full paper. The ProgrammeCommittee selected 34 papers for presentation at the conference and publication in these proceedings. The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. The awardrecipient for 2009 was Jakob Nordstr¨ om. Citation of the award, abstract of the thesis, and a biographical sketch of the recipient may be found at the end of the proceedings. The award was sponsored for the years 2007–2009 by Logitech S.A.
Computer logic --- Computer Science --- Mathematical Theory --- Engineering & Applied Sciences --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Logic, Symbolic and mathematical --- Data processing. --- Computer science. --- Coding theory. --- Computer logic. --- Mathematical logic. --- Computer science --- Artificial intelligence. --- Computer Science. --- Artificial Intelligence (incl. Robotics). --- Mathematical Logic and Foundations. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Symbolic and Algebraic Manipulation. --- Coding and Information Theory. --- Mathematics. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Computer mathematics --- Discrete mathematics --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Signal theory (Telecommunication) --- Computer programming --- Informatics --- Science --- Logic, Symbolic and mathematical. --- Logic design. --- Artificial Intelligence. --- Design, Logic --- Design of logic systems --- Electronic circuit design --- Logic circuits --- Switching theory --- Computer science—Mathematics. --- Information theory. --- Communication theory --- Communication --- Cybernetics --- Machine theory. --- Formal Languages and Automata Theory. --- Computer Science Logic and Foundations of Programming. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics
Choose an application
This book gives a broad overview of core topics of finite model theory: expressive power, descriptive complexity, and zero-one laws, together with selected applications to database theory and artificial intelligence, especially, constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, which emphasizes the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of, and hierarchies within, first order, second order, fixed point, and infinitary logics to gain insight into phenomena in complexity theory and combinatorics. The book emphasizes the use of combinatorial games, such as extensions and refinements of the Ehrenfeucht-Fraissé pebble game, as a powerful technique for analyzing the expressive power of such logics, and illustrates how deep notions from model theory and combinatorics, such as o-minimality and tree-width, arise naturally in the application of finite model theory to database theory and AI. Students of logic and computer science will find here the tools necessary to embark on research in finite model theory, and all readers will experience the excitement of a vibrant area of application of logic to computer science.
Finite model theory. --- Computational complexity. --- Constraint databases. --- Databases --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computer science --- Model theory --- Mathematics --- Information theory. --- Computer science. --- Software engineering. --- Logic design. --- Database management. --- Theory of Computation. --- Mathematical Logic and Formal Languages. --- Software Engineering. --- Computation by Abstract Devices. --- Logics and Meanings of Programs. --- Database Management. --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Computer software engineering --- Engineering --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Computers. --- Mathematical logic. --- Computer logic. --- Computer science logic --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Calculators --- Cyberspace
Choose an application
Mathematical logic --- Computer science --- Information systems --- Computer. Automation --- informatica --- programmeren (informatica) --- database management --- wiskunde --- software engineering --- logica
Choose an application
Listing 1 - 10 of 11 | << page >> |
Sort by
|