Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	März 2005
Genre:	EDV / Informatik
	Artificial Intelligence / C / Computer architecture & logic design / Computer logic / Computer programming / Computer programming / software engineering / computer science / Computer Science Logic and Foundations of Programming / Computerprogrammierung und Softwareentwicklung / Formal Languages and Automata Theory / Künstliche Intelligenz / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical theory of computation / Operating systems / Programming Techniques / Software Engineering / Software Engineering/Programming and Operating Systems / Theoretische Informatik mehr...
ISBN:	9783540252368
EAN-Code:	9783540252368
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	Lecture Notes in Artificial Intelligence #3452 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	973 gr
Seiten:	560
Illustration:	XII, 560 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

CERES in Many-Valued Logics.- A Decomposition Rule for Decision Procedures by Resolution-Based Calculi.- Abstract DPLL and Abstract DPLL Modulo Theories.- Combining Lists with Non-stably Infinite Theories.- Abstract Model Generation for Preprocessing Clause Sets.- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.- Applications of General Exact Satisfiability in Propositional Logic Modelling.- BCiC: A System for Code Authentication and Verification.- Ordered Resolution with Selection for .- On a Semantic Subsumption Test.- Suitable Graphs for Answer Set Programming.- Weighted Answer Sets and Applications in Intelligence Analysis.- How to Fix It: Using Fixpoints in Different Contexts.- Reasoning About Systems with Transition Fairness.- Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games.- How the Location of * Influences Complexity in Kleene Algebra with Tests.- The Equational Theory of ??, 0, 1,?+?, ×, ?? Is Decidable, but Not Finitely Axiomatisable.- A Trichotomy in the Complexity of Propositional Circumscription.- Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems.- Evaluating QBFs via Symbolic Skolemization.- The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.- Automated Termination Analysis for Incompletely Defined Programs.- Automatic Certification of Heap Consumption.- A Formalization of Off-Line Guessing for Security Protocol Analysis.- Abstraction-Carrying Code.- A Verification Environment for Sequential Imperative Programs in Isabelle/HOL.- Can a Higher-Order and a First-Order Theorem Prover Cooperate?.- A Generic Framework for Interprocedural Analyses of NumericalProperties.- Second-Order Matching via Explicit Substitutions.- Knowledge-Based Synthesis of Distributed Systems Using Event Structures.- The Inverse Method for the Logic of Bunched Implications.- Cut-Elimination: Experiments with CERES.- Uniform Rules and Dialogue Games for Fuzzy Logics.- Nonmonotonic Description Logic Programs: Implementation and Experiments.- Implementing Efficient Resource Management for Linear Logic Programming.- Layered Clausal Resolution in the Multi-modal Logic of Beliefs and Goals.